Abstract
The realtime one-state deterministic pushdown automata with jumps define the family of deterministic languages. A simplified regularity test for deterministic languages can be derived from this fact.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho and S. C. Johnson, Optimal code generation for expression trees, 7th Annual Symposium on Computing (SIGACT), Albuquerque, (1975), 207–217.
W. S. Brainerd, Tree generating regular systems,Inf. and Cont. 14 (1969), 217–231.
J. R. Büchi, Regular canonical systems,Archiv. für mathematische Logik und Grundlagenforschung 6 (1964), 91–111.
B. Courcelle, Recursive schemes, algebraic trees and deterministic languages, Proc. of the 15th Annual Symp. on Switching and Automata Theory, New Orleans (1974), 52–62.
B. Courcelle, Sur les ensembles algébriques d'arbres et les langages déterministes, quelques applications à la théorie des schémas de programme. Thèse, Université de Paris 7 (1976).
B. Courcelle, A representation of trees by languages, to appear in Theor. Comp. Sc.
J. Engelfriet andE. M. Schmidt, IO and OI, Report PB-47, Aarhus University, Danemark (1975).
M. Fischer, Grammars with macro-like instructions, Proc. of 9th Annual Symposium on Switching and Automata Theory (1968), 131–142.
E. P. Friedman, Relationships between monadic recursion schemes and deterministic contextfree languages, Proc. of the 15th Annual Symp. on Switching and Automata Theory, New Orleans (1974), 43–51.
S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.
S. Ginsburg andS. Greibach, Deterministic context-free languages,Inf. and Cont. 9 (1966), 620–648.
S. A. Greibach, Jump-PDA's and hierarchies of context-free languages,SIAM J. on Computing 3 (1974), 111–127.
S. A. Greibach, Jump PDA's, deterministic context-free languages, principal AFDL's and polynomial time recognition. Unpublished report, preliminary version of [12].
S. A. Greibach, personal communication.
M. A. Harrison andI. M. Havel, Strict deterministic grammars,Journal of Computer and System Sciences 7 (1973), 237–277.
M. A. Harrison andI. M. Havel, Real-time strict deterministic languages,SIAM Journal on Computing 1 (1972), 333–349.
M. A. Harrison andI. M. Havel, On the parsing of deterministic languages,JACM 21 (1974), 525–548.
N. Honda and M. Oyamaguchi, The decidability of equivalence for deterministic stateless pushdown automata. Submitted for publication.
J. E. Hopcroft and A. J. Korenjak, Simple deterministic languages, 7th Annual Symposium on Switching and Automata Theory, Berkeley (1966), 36–46.
T. Kasami andK. Taniguchi, A result on the equivalence problem for deterministic pushdown automata,J.C.S.S. 13 (1976), 38–50.
D. J. Rosenkrantz andR. E. Stearns, Properties of deterministic top-down grammars,Information and Control 17 (1970), 226–256.
M. P. Schützenberger, On context-free languages and push-down automata,Information and Control 6 (1963), 246–264.
R. E. Stearns, A regularity test for pushdown machines,Inf. and Cont. 11 (1967), 323–340.
H. R. Strong andS. A. Walter, Characterizations of flowchartable recursions,J.C.S.S. 7 (1973), 404–447.
L. G. Valiant, Regularity and related problems for deterministic pushdown automata,JACM 22 (1975), 1–10.
L. G. Valiant, Decision procedures for families of deterministic pushdown automata, Report nå7 (1973), Warwick University, England.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Courcelle, B. On jump-deterministic pushdown automata. Math. Systems Theory 11, 87–109 (1977). https://doi.org/10.1007/BF01768471
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01768471