| Jacques Sakarovitch. Pushdown automata with terminal languages. In Languages and Automata Symposium, number 421 in Publication RIMS, Kyoto University, pages 15--29, 1981. |
....a word x gives the number of different leftmost derivations for x. For pushdown automata, the mode of acceptance is generally chosen to give the simplest proofs for one s purpose. Other modes of acceptance than the ones quoted above have been investigated. For instance, a result of Sakarovitch [46] shows that if K = q2Q fqg Theta L q with L q context free, then the language recognized remains context free. The characterization of context free languages in terms of languages recognized by pda s allows much simpler proofs of certain properties of contextfree languages. Example 5.2. In ....
Jacques Sakarovitch. Pushdown automata with terminal languages. In Languages and Automata Symposium, number 421 in Publication RIMS, Kyoto University, pages 15--29, 1981.
....a word x gives the number of different leftmost derivations for x. For pushdown automata, the mode of acceptance is generally chosen to give the simplest proofs for one s purpose. Other modes of acceptance than the ones quoted above have been investigated. For instance, a result of Sakarovitch [46] shows that if K = q2Q fqg Theta L q with L q context free, then the language recognized remains context free. The characterization of context free languages in terms of languages recognized by pda s allows much simpler proofs of certain properties of contextfree languages. Example 5.2. In ....
Jacques Sakarovitch. Pushdown automata with terminal languages. In Languages and Automata Symposium, number 421 in Publication RIMS, Kyoto University, pages 15--29, 1981.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC