Pumping and pushdown machines
RAIRO-Theor. Inf. Appl., 28 3-4 (1994) 221-232
Published online: 2017-02-03
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Pushdown and one-counter automata: Constant and non-constant memory usage
Giovanni Pighizzini and Luca PrigionieroInformation and Computation 306 105329 (2025)
https://doi.org/10.1016/j.ic.2025.105329
Deciding path size of nondeterministic (and input-driven) pushdown automata
Yo-Sub Han, Sang-Ki Ko and Kai SalomaaTheoretical Computer Science 939 170 (2023)
https://doi.org/10.1016/j.tcs.2022.10.023
13918 146 (2023)
https://doi.org/10.1007/978-3-031-34326-1_11
IN MEMORIAM CHANDRA KINTALA
MARTIN KAPPES, ANDREAS MALCHER and DETLEF WOTSCHKEInternational Journal of Foundations of Computer Science 23 (01) 5 (2012)
https://doi.org/10.1142/S0129054112400011
A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES
ENZO MAGALINI and GIOVANNI PIGHIZZINIInternational Journal of Foundations of Computer Science 18 (06) 1303 (2007)
https://doi.org/10.1142/S0129054107005340
Measuring nondeterminism in pushdown automata
Jonathan Goldstine, Hing Leung and Detlef WotschkeJournal of Computer and System Sciences 71 (4) 440 (2005)
https://doi.org/10.1016/j.jcss.2005.04.001
Results and Trends in Theoretical Computer Science
Kai Salomaa, Derick Wood and Sheng YuLecture Notes in Computer Science, Results and Trends in Theoretical Computer Science 812 372 (1994)
https://doi.org/10.1007/3-540-58131-6_60