@article{ITA_1994__28_3-4_221_0,
author = {Salomaa, Kai and Wood, D. and Yu, Sheng},
title = {Pumping and pushdown machines},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {221--232},
year = {1994},
publisher = {EDP Sciences},
volume = {28},
number = {3-4},
mrnumber = {1282445},
zbl = {0883.68093},
language = {en},
url = {https://www.numdam.org/item/ITA_1994__28_3-4_221_0/}
}
TY - JOUR AU - Salomaa, Kai AU - Wood, D. AU - Yu, Sheng TI - Pumping and pushdown machines JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1994 SP - 221 EP - 232 VL - 28 IS - 3-4 PB - EDP Sciences UR - https://www.numdam.org/item/ITA_1994__28_3-4_221_0/ LA - en ID - ITA_1994__28_3-4_221_0 ER -
%0 Journal Article %A Salomaa, Kai %A Wood, D. %A Yu, Sheng %T Pumping and pushdown machines %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1994 %P 221-232 %V 28 %N 3-4 %I EDP Sciences %U https://www.numdam.org/item/ITA_1994__28_3-4_221_0/ %G en %F ITA_1994__28_3-4_221_0
Salomaa, Kai; Wood, D.; Yu, Sheng. Pumping and pushdown machines. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Special issue for Professor Karel Culik II : 60 th birthday, Tome 28 (1994) no. 3-4, pp. 221-232. https://www.numdam.org/item/ITA_1994__28_3-4_221_0/
1. and , The Language of Machines: An Introduction to Computability and Formal Language Theory, Francisco, CA, 1994.
2. , Automata with data storage, In Proceedings of the Conference on Theoretical Computer Science, Waterloo, Canada, 1977, , University of Waterloo, pp. 239-246. | Zbl | MR
3. , A rational theory of AFLs, In Proceedings of the Sixth Colloquium on Automata, Languages, and Programming, Volume 71 of Lecture Notes in Computer Science, NewYork, NY, 1979, Springer-Verlag, pp. 271-281. | Zbl | MR
4. , Formal languages and their relation to automata: What Hopcroft & Ullman didn't tell us, In R.V. Book, Editor, Formal Language Theory: Perspectives and Open Problems, NewYork, NY, 1980, Academic Press, pp. 109-140.
5. , Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978. | Zbl | MR
6. , Describing automata in terms of languages associated with their peripheral devices, Technical Report STAN-CS-75-493, Computer Science Department, Stanford University, Stanford, CA, 1975.
7. and , Degrees of nondeterminism for pushdown automata, In Proceedings of the 8th Fundamentals of Computation Theory Conference, Volume 529 of Lecture Notes in Computer Science, New York, NY, 1991. .Springer-Verlag, pp. 380-389. | Zbl | MR
8. and , Limited nondeterminism for pushdown automata, Bulletin of the European Association for Theoretical Computer Science, 1993, 50, pp. 186-193. | Zbl
9. and , Measures of nondeterminism forpushdown automata, Journal of Computer and System Sciences, to appear. | Zbl | MR
10. and , On the amount of nondeterminism in pushdown automata, Fundamenta Informaticae, 1981, 4, pp. 401-418. | Zbl | MR
11. , Theory of Computation, John Wiley & Sons, Inc., New York, NY, second edition, 1993, In preparation. | Zbl






