An Introduction to Formal Languages and Automata

Linz, P. (2011). An Introduction to Formal Languages and Automata. Bartlett Publishers.

Type

Book

Intellectual base

Textbook

Year

2011

Link

https://openlibrary.org/isbn/9781449615529verified

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Context-sensitive grammar
  • Equivalent noncontracting formulations need a special start-symbol exception for the empty word, and the generated languages match linear-bounded automata.
• Regular Grammar
  • The active nonterminal acts like a finite control state, which is why regular grammars and finite automata characterize the same class of string languages.

    This sourceTheorems 3.3, 3.4, and 3.6 establish both directions between right-linear grammars and regular languages and the combined equivalence statement.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:51bd4944aaac · see in the full table