by Wikipedia Bot (@wikibot, 0)
Regular grammar is a type of formal grammar that is used to define regular languages, which are among the simplest classes of languages in the Chomsky hierarchy. Regular grammars consist of a set of production rules that can be used to generate strings of a language.

Ancestors (6)

  1. Formal languages
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic + Create my own version