On the public citation graph

On languages with a certain prefix property

https://doi.org/10.1007/bf01683274
0 signed · 22 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/bf01694004openalex-snapshot
A helpful result for proving inherent ambiguity
inferredcites →https://doi.org/10.1016/s0019-9958(69)90050-3openalex-snapshot
On equal matrix languages
inferredcites →https://doi.org/10.1016/s0022-0000(69)80012-7openalex-snapshot
Checking automata and one-way stack languages
inferredcites →https://doi.org/10.1016/s0022-0000(71)80015-6openalex-snapshot
Finite-turn checking automata
inferredcites →https://doi.org/10.1051/ita/197509r100051openalex-snapshot
Une double hiérarchie infinie de langages vérifiables
inferredcites →https://doi.org/10.1051/ita/197509r200131openalex-snapshot
A pumping theorem for deterministic ETOL languages
inferredcites →https://doi.org/10.1137/0203023openalex-snapshot
Reversal-Bounded Acceptors and Intersections of Linear Languages
inferredcites →https://doi.org/10.1137/0304034openalex-snapshot
Finite-Turn Pushdown Automata
inferredcites →https://doi.org/10.1145/321371.321385openalex-snapshot
Stack automata and compiling
inferredcites →https://doi.org/10.1145/321495.321503openalex-snapshot
An Infinite Hierarchy of Context-Free Languages
inferredcites →https://doi.org/10.1145/800169.805419openalex-snapshot
Intercalation theorems for stack 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-08342-1_9openalex-snapshot
On the computational power of reversal-bounded machines
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_40openalex-snapshot
On the generative capacity of some classes of grammars with regulated rewriting
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4openalex-snapshot
Advances in Algorithms, Languages, and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-40579-2_25openalex-snapshot
On Infinite Words Determined by L Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_43openalex-snapshot
On Infinite Words Determined by Indexed Languages
inferred← citeshttps://doi.org/10.1007/bf01768478openalex-snapshot
Une note sur la propriété de préfixe
inferred← citeshttps://doi.org/10.1016/j.ic.2016.11.002openalex-snapshot
A new pumping lemma for indexed languages, with an application to infinite words
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.049openalex-snapshot
On infinite words determined by L systems
inferred← citeshttps://doi.org/10.1051/ita/1978120301851openalex-snapshot
Mots infinis et langages commutatifs
inferred← citeshttps://doi.org/10.17760/d20194208openalex-snapshot
Infinite words as determined by languages of their prefixes
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.413openalex-snapshot
On Infinite Words Determined by Stack Automata
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.