𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parsing regular grammars with finite lookahead

✍ Scribed by Thomas J. Ostrand; Marvin C. Paull; Elaine J. Weyuker

Publisher
Springer-Verlag
Year
1981
Tongue
English
Weight
795 KB
Volume
16
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Simulating finite automata with context-
Simulating finite automata with context-free grammars
✍ Michael Domaratzki; Giovanni Pighizzini; Jeffrey Shallit πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 78 KB

We consider simulating finite automata (both deterministic and nondeterministic) with context-free grammars in Chomsky normal form (CNF). We show that any unary DFA with n states can be simulated by a CNF grammar with O(n 1/3 ) variables, and this bound is tight. We show that any unary NFA with n st