On the public citation graph

On the complexity of finite, pushdown, and stack automata

https://doi.org/10.1007/bf01683261
0 signed · 49 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-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_5openalex-snapshot
Super-Exponential Complexity of Presburger Arithmetic
inferredcites →https://doi.org/10.1007/bf01695769openalex-snapshot
Mappings and grammars on trees
inferredcites →https://doi.org/10.1007/bfb0064872openalex-snapshot
Weak monadic second order theory of succesor is not elementary-recursive
inferredcites →https://doi.org/10.1016/s0019-9958(68)91087-5openalex-snapshot
Time and tape complexity of pushdown automaton languages
inferredcites →https://doi.org/10.1016/s0022-0000(67)80013-8openalex-snapshot
Nonerasing stack automata
inferredcites →https://doi.org/10.1016/s0022-0000(69)80015-2openalex-snapshot
Scattered context grammars
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1016/s0022-0000(71)80029-6openalex-snapshot
Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata
inferredcites →https://doi.org/10.1016/s0022-0000(76)80038-4openalex-snapshot
On the equivalence, containment, and covering problems for the regular and context-free languages
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1109/swat.1973.20openalex-snapshot
On tape-bounded complexity classes and multi-head finite automata
inferredcites →https://doi.org/10.1109/swat.1973.25openalex-snapshot
Refinements of the nondeterministic time and space hierarchies
inferredcites →https://doi.org/10.1109/swat.1973.5openalex-snapshot
Complexity of recognition in intermediate Level languages
inferredcites →https://doi.org/10.1109/swat.1974.29openalex-snapshot
Two way deterministic pushdown automaton languages and some open problems in the theory of computation
inferredcites →https://doi.org/10.1137/0201019openalex-snapshot
On Languages Accepted in Polynomial Time
inferredcites →https://doi.org/10.1137/0202025openalex-snapshot
The Hardest Context-Free Language
inferredcites →https://doi.org/10.1145/321356.321362openalex-snapshot
Two-Tape Simulation of Multitape Turing Machines
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars
inferredcites →https://doi.org/10.1145/321495.321504openalex-snapshot
Programmed Grammars and Classes of Formal Languages
inferredcites →https://doi.org/10.1145/321526.321529openalex-snapshot
Nested Stack Automata
inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/321724.321727openalex-snapshot
A Note Concerning Nondeterministic Tape Complexities
inferredcites →https://doi.org/10.1145/800119.803882openalex-snapshot
Storage requirements for deterministic / polynomial time recognizable languages
inferredcites →https://doi.org/10.1145/800119.803883openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1145/800119.803885openalex-snapshot
Computational parallels between the regular and context-free languages
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1145/800125.804030openalex-snapshot
On the time and tape complexity of languages I
inferredcites →https://doi.org/10.1145/800125.804032openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1145/800157.805045openalex-snapshot
Absolutely parallel grammars and two-way deterministic finite-state transducers
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1145/800161.805156openalex-snapshot
Tree-oriented proofs of some theorems on context-free and indexed languages
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

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-54458-5_64openalex-snapshot
Computational complexity and hardest languages of automata with abstract storages
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_33openalex-snapshot
The emptiness problem for intersections of regular languages
inferred← citeshttps://doi.org/10.1007/978-3-031-89432-9_1openalex-snapshot
Introduction to Forest Harvest Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_12openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_3openalex-snapshot
Input-Driven Stack Automata
inferred← citeshttps://doi.org/10.1007/bfb0015925openalex-snapshot
Complexity theory and formal languages
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90015-topenalex-snapshot
Iterated stack automata and complexity classes
inferred← citeshttps://doi.org/10.1080/00207168108803261openalex-snapshot
Time and space complexity of inside-out macro languages
inferred← citeshttps://doi.org/10.1137/0207007openalex-snapshot
Computational Parallels between the Regular and Context-Free Languages
inferred← citeshttps://doi.org/10.1137/0207032openalex-snapshot
Polynomial Algorithms for Deterministic Pushdown Automata
inferred← citeshttps://doi.org/10.1145/322017.322020openalex-snapshot
On Equivalence and Containment Problems for Formal Languages
inferred← citeshttps://doi.org/10.1145/800061.808767openalex-snapshot
Iterated pushdown automata and complexity classes
inferred← citeshttps://doi.org/10.1145/800116.803753openalex-snapshot
On the complexity of grammar and related problems
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.