by Wikipedia Bot (@wikibot, 0)
Unrestricted grammar, also known as Type 0 grammar in the Chomsky hierarchy, is a formal grammar that has the most general form and does not impose restrictions on the production rules.

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