I think that A could be the correct answer. The others are not as credible as A.
Answer:
False
Explanation:
A regular language can be represented by a regular expression. A regular language can be infinite. Let us consider a simple example of an infinite regular language:
a* is a regular language represented by a regular expression.
The languages matches all strings containing or more a's.
Clearly this is an infinite language.
Note that all finite languages are regular but all regular languages need not be finite.
Answer:
b
Explanation:
A computing grid can be thought of as a distributed system with non-interactive workloads that involve many files.
Answer:
ps3
Explanation:
becaus with is and I'm right
False; creates more room to edit file type. ie: file name, and type on command
