14 pages matching context-free languages in this book
Results 1-3 of 14
What people are saying - Write a review
We haven't found any reviews in the usual places.
2-way finite 2csa 2dgsm mappings 2DGSM(L 2DGSM(REG 2dpda 2GSM 5-tuple acceptor active j-node AhoHopU AhoUll algorithm automata theory binary search trees checking stack class of languages complexity sequence Computer Science context-free grammar context-free languages Corollary corresponding cs-pd D-trees dcs-pd transducer defined Delete denotes derivation tree deterministic dgsm DPAM ETOL Exercise finite control finite state automaton finite state transducer finite visit Fundamental Theorem guesses hence input head input string input tape input[x ISBN 90 j-joint j-leaves languages accepted Lemma linear macro grammars Mehlhorn multi-head node nondeterministic Note NSPACE(n P-SPACE P-TIME polynomial problem proof of Theorem pushdown automata pushdown transducer register programs regular language rotation simulates space square stack automata storage type subtree suffix symbol total recursive function transition table translation tree transducer Turing machine two-way Unterauer visiting sequence visiting sets weight-balanced trees weighted path length