On the public citation graph

Über einen Automaten mit Pufferspeicherung

0 signed · 41 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-3-642-95327-9openalex-snapshot
Aufzählbarkeit Entscheidbarkeit Berechenbarkeit
inferredcites →https://doi.org/10.1007/978-3-662-01462-2openalex-snapshot
Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit
inferredcites →https://doi.org/10.1007/bf01692510openalex-snapshot
The theory of languages
inferredcites →https://doi.org/10.1007/bf02759719openalex-snapshot
Real time computation
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(59)90362-6openalex-snapshot
On certain formal properties of grammars
inferredcites →https://doi.org/10.1016/s0019-9958(66)90211-7openalex-snapshot
Preservation of languages by transducers
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08555-9openalex-snapshot
A variant of a recursively unsolvable problem
inferredcites →https://doi.org/10.1109/pgec.1964.263815openalex-snapshot
Decision Problems of Phrase-Structure Grammars
inferredcites →https://doi.org/10.1145/321160.321170openalex-snapshot
Computability of Recursive Functions
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.2307/2002808openalex-snapshot
Computability and Unsolvability.
inferredcites →https://doi.org/10.2307/2309822openalex-snapshot
Computability and Unsolvability.

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-10854-8_6openalex-snapshot
Analogies of PAL and COPY
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_8openalex-snapshot
Real-time scheduling by queue automata
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_16openalex-snapshot
Most Pseudo-copy Languages Are Not Context-Free
inferred← citeshttps://doi.org/10.1007/978-3-032-20684-8_2openalex-snapshot
The Queue Automaton Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_30openalex-snapshot
A Note on Pushdown Automata Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-73216-9_19openalex-snapshot
Queue Automata: Foundations and Developments
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_20openalex-snapshot
Deque Languages, Automata and Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_3openalex-snapshot
Reversible and Irreversible Computations of Deterministic Finite-State Devices
inferred← citeshttps://doi.org/10.1007/bfb0017139openalex-snapshot
Breadth-first phrase structure grammars and queue automata
inferred← citeshttps://doi.org/10.1007/bfb0055110openalex-snapshot
Efficient simulations by queue machines
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90026-4openalex-snapshot
Multiple equality sets and post machines
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90053-5openalex-snapshot
QRT FIFO automata, breadth-first grammars and their relations
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90211-bopenalex-snapshot
On the power of several queues
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.005openalex-snapshot
Two collapsing hierarchies of subregularly tree controlled languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.012openalex-snapshot
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.02.029openalex-snapshot
Deque automata, languages, and planar graph representations
inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90426-5openalex-snapshot
One-way multihead writing finite automata
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00091-xopenalex-snapshot
Fast nondeterministic recognition of context-free languages using two queues
inferred← citeshttps://doi.org/10.1051/ita/2018009openalex-snapshot
Diving into the queue
inferred← citeshttps://doi.org/10.1109/mcsoc57363.2022.00013openalex-snapshot
Buffer Allocation for Exposed Datapath Architectures
inferred← citeshttps://doi.org/10.1109/memcod.2016.7797759openalex-snapshot
Optimal compilation for exposed datapath architectures with buffered processing units by SAT solvers
inferred← citeshttps://doi.org/10.1109/swat.1971.8openalex-snapshot
Computation by multi-head finite automata
inferred← citeshttps://doi.org/10.1142/s012905410700525xopenalex-snapshot
PROGRAMMED GRAMMARS WITH RULE QUEUES
inferred← citeshttps://doi.org/10.1142/s0129054120420022openalex-snapshot
Boosting Reversible Pushdown and Queue Machines by Preprocessing
inferred← citeshttps://doi.org/10.1145/3519941.3535076openalex-snapshot
Code generation criteria for buffered exposed datapath architectures from dataflow graphs
inferred← citeshttps://doi.org/10.1145/3607869openalex-snapshot
Consistency Constraints for Mapping Dataflow Graphs to Hybrid Dataflow/von Neumann Architectures
inferred← citeshttps://doi.org/10.1145/3610579.3611079openalex-snapshot
Allocation and Scheduling of Dataflow Graphs on Hybrid Dataflow/von Neumann Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1810.12095openalex-snapshot
On the Power of Quantum Queue Automata in Real-time
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.