On the public citation graph

Breadth-first phrase structure grammars and queue automata

0 signed · 15 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/3-540-16761-7_55openalex-snapshot
Intersections of some families of languages
inferredcites →https://doi.org/10.1007/bf02234250openalex-snapshot
Über einen Automaten mit Pufferspeicherung
inferredcites →https://doi.org/10.1016/0022-0000(80)90026-4openalex-snapshot
Multiple equality sets and post machines
inferredcites →https://doi.org/10.1016/0304-3975(80)90047-xopenalex-snapshot
Automates a file
inferredcites →https://doi.org/10.1016/0304-3975(85)90164-1openalex-snapshot
Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages

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_59openalex-snapshot
Deterministic dequeue automata and LL(1) parsing of breadth-depth grammars
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_139openalex-snapshot
Deterministic parsing for augmented context-free grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-39310-5_13openalex-snapshot
Queue Automata of Constant Length
inferred← citeshttps://doi.org/10.1007/s00236-021-00398-7openalex-snapshot
The descriptional power of queue automata of constant length
inferred← citeshttps://doi.org/10.1016/0167-2789(94)90273-9openalex-snapshot
The calculi of emergence: computation, dynamics and induction
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/s0167-2789(99)00126-8openalex-snapshot
Queues, stacks, and transcendentality at the transition to chaos
inferred← citeshttps://doi.org/10.1109/soca.2013.61openalex-snapshot
Unified Execution of Service Compositions (Short Paper)
inferred← citeshttps://doi.org/10.3390/app12146928openalex-snapshot
DNA Computing: Concepts for Medical Applications
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.