answersLogoWhite

0

it is not regular language .it is high level language

User Avatar

Wiki User

14y ago

What else can I help you with?

Related Questions

Is it true that if a language a is regular and language b reduces to a, then language b is also regular?

No, it is not necessarily true that if language A is regular and language B reduces to A, then language B is also regular.


How can you prove that the complement of a regular language is regular?

The complement of a regular language is regular because regular languages are closed under complementation. This means that if a language is regular, its complement is also regular.


What is the complement of a regular language and how does it relate to the concept of regular expressions?

The complement of a regular language is the set of all strings that are not in the original language. In terms of regular expressions, the complement of a regular language can be represented by negating the regular expression that defines the original language.


How can you prove that the reverse of a regular language is regular?

The reverse of a regular language is regular because for every string in the original language, there exists a corresponding string in the reversed language that is also regular. This is because regular languages are closed under the operation of reversal, meaning that if a language is regular, its reverse will also be regular.


Can a regular language be infinite?

Yes, a regular language can be infinite.


Is "Is sigma star a regular language"?

No, sigma star is not a regular language.


Is every finite language regular?

No, not every finite language is regular.


Why c language has name c why not a?

C-language was derived from B-language.


What are some examples of closure properties of regular languages?

Closure properties of regular languages include: Union: The union of two regular languages is also a regular language. Intersection: The intersection of two regular languages is also a regular language. Concatenation: The concatenation of two regular languages is also a regular language. Kleene star: The Kleene star operation on a regular language results in another regular language.


What is previous language of c language?

language before c language is pascal


What is C language what does it do?

C Language is First Step of Programming Language, Help for C Language you are show the correct answer


Is it true that a context-free language is a subset of a regular language?

Yes, it is true that a context-free language is a superset of a regular language.