On the public citation graph

On jump-deterministic pushdown automata

https://doi.org/10.1007/bf01768471
0 signed · 52 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_19openalex-snapshot
Regular Canonical Systems
inferredcites →https://doi.org/10.1007/bf01969548openalex-snapshot
Regular canonical systems
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/s0019-9958(63)90306-1openalex-snapshot
On context-free languages and push-down automata
inferredcites →https://doi.org/10.1016/s0019-9958(66)80019-0openalex-snapshot
Deterministic context free languages
inferredcites →https://doi.org/10.1016/s0019-9958(67)90591-8openalex-snapshot
A regularity test for pushdown machines
inferredcites →https://doi.org/10.1016/s0019-9958(69)90065-5openalex-snapshot
Tree generating regular systems
inferredcites →https://doi.org/10.1016/s0019-9958(70)90446-8openalex-snapshot
Properties of deterministic top-down grammars
inferredcites →https://doi.org/10.1016/s0019-9958(78)90139-0openalex-snapshot
The decidability of equivalence for deterministic stateless pushdown automata
inferredcites →https://doi.org/10.1016/s0022-0000(73)80008-xopenalex-snapshot
Strict deterministic grammars
inferredcites →https://doi.org/10.1016/s0022-0000(73)80032-7openalex-snapshot
Characterizations of flowchartable recursions
inferredcites →https://doi.org/10.1016/s0022-0000(76)80049-9openalex-snapshot
A result on the equivalence problem for deterministicpushdown automata
inferredcites →https://doi.org/10.1109/swat.1966.22openalex-snapshot
Simple deterministic languages
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1109/swat.1974.23openalex-snapshot
Recursive schemes, algebraic trees and deterministic languages
inferredcites →https://doi.org/10.1109/swat.1974.24openalex-snapshot
Relationships between monadic recursion schemes and deterministic context-free languages
inferredcites →https://doi.org/10.1137/0201024openalex-snapshot
Real-Time Strict Deterministic Languages
inferredcites →https://doi.org/10.1137/0203009openalex-snapshot
Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
inferredcites →https://doi.org/10.1145/321850.321851openalex-snapshot
On the Parsing of Deterministic Languages
inferredcites →https://doi.org/10.1145/321864.321865openalex-snapshot
Regularity and Related Problems for Deterministic Pushdown Automata
inferredcites →https://doi.org/10.1145/321958.321970openalex-snapshot
Optimal Code Generation for Expression Trees
inferredcites →https://doi.org/10.1145/800116.803770openalex-snapshot
Optimal code generation for expression trees
inferredcites →https://doi.org/10.82444/warw.33595291openalex-snapshot
Decision procedures for families of deterministic pushdown automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-09526-8_33openalex-snapshot
New proofs for jump dpda's
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_64openalex-snapshot
On pushdown tree automata
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_106openalex-snapshot
On containment problems for finite-turn languages
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_29openalex-snapshot
The tree equivalence problem for linear recursion schemes
inferred← citeshttps://doi.org/10.1007/978-1-4939-0369-6_18openalex-snapshot
Chapter 18 Deep Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-63100-4_10openalex-snapshot
Algebra, Automata, and Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_3openalex-snapshot
Context-Free Languages and Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferred← citeshttps://doi.org/10.1007/bf01744582openalex-snapshot
Pushdown tree automata
inferred← citeshttps://doi.org/10.1007/s00236-006-0005-0openalex-snapshot
Deep pushdown automata
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90046-6openalex-snapshot
Tree equivalence of linear recursive schemata is polynomial-time decidable
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90008-7openalex-snapshot
A representation of trees by languages I
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90039-7openalex-snapshot
A representation of trees by languages II
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90055-4openalex-snapshot
DPDA's in ‘atomic normal form’ and applications to equivalence problems
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90039-2openalex-snapshot
Some results on subclass containment problems for special classes of DPDA'S related to nonsingular machines
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90054-9openalex-snapshot
New families of non real time dpda's and their decidability results
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90123-yopenalex-snapshot
A characterisation of deterministic context-free languages by means of right-congruences
inferred← citeshttps://doi.org/10.1016/j.jvlc.2018.11.001openalex-snapshot
Generating fluent embedded domain-specific languages with subchaining
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90256-9openalex-snapshot
A real-time strictness test for deterministic pushdown automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90263-6openalex-snapshot
A simplicity test for deterministic pushdown automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00207-2openalex-snapshot
The tree equivalence of linear recursion schemes
inferred← citeshttps://doi.org/10.1051/ita/1987210302451openalex-snapshot
Decidable subcases of the equivalence problem for recursive program schemes
inferred← citeshttps://doi.org/10.1145/3009837.3009871openalex-snapshot
Java generics are turing complete
inferred← citeshttps://doi.org/10.1145/3093333.3009871openalex-snapshot
Java generics are turing complete
inferred← citeshttps://doi.org/10.1145/3136040.3136041openalex-snapshot
Silverchain: a fluent API generator
inferred← citeshttps://doi.org/10.1145/3170492.3136041openalex-snapshot
Silverchain: a fluent API generator
inferred← citeshttps://doi.org/10.1145/3360560openalex-snapshot
Generating a fluent API with syntax checking from an LR grammar
inferred← citeshttps://doi.org/10.22152/programming-journal.org/2020/4/9openalex-snapshot
Generating a Generic Fluent API in Java
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.