A Generalization of Context-Free Determinism
暂无分享,去创建一个
Nondeterministic Turing machines, under the restriction that each square be written on only a fixed number of times, recognize all and only context free languages. The deterministic subclass gives rise to a hierarchical extension of the pushdown deterministic languages. Unambiguity in terms of the machines is the same as grammatical unambiguity.
[1] F. C. Hennie,et al. One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..
[2] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[3] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[4] Seymour Ginsburg,et al. Deterministic Context Free Languages , 1965, Inf. Control..
[5] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.