Direction-independent grammars with contexts
โ Scribed by Kunio Aizawa; Akira Nakamura
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 797 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
A homogeneous production has its left-hand side formed by a non-empty string of identical nonterminals. A phrase-structure grammar is homogeneous if each of its productions is homogeneous. The present paper discusses the reduction of homogeneous grammars with respect to the number of non-context-fre