On the public citation graph
A helpful result for proving inherent ambiguity
0 signed · 146 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1145/321312.321318openalex-snapshot
Ambiguity in context free languages
inferredcites →https://doi.org/10.2307/2284003openalex-snapshot
Handbook of Mathematical Psychology. Vol. 2.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11505877_33openalex-snapshot
On Some Properties of the Language of 2-Collapsing Words
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_12openalex-snapshot
Un langage algebrique non-generateur
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_15openalex-snapshot
On three types of unambiguity of context-free language
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_26openalex-snapshot
States can sometimes do more than stack symbols in PDA's
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_7openalex-snapshot
Strong non-deterministic context-free languages
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_4openalex-snapshot
Inherent ambiguities in families of grammars extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_44openalex-snapshot
A new operation between languages
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_89openalex-snapshot
Pushdown automata with restricted use of storage symbols
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_18openalex-snapshot
Strong iteration lemmata for regular, linear, context-free, and linear indexed languages
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_29openalex-snapshot
A maximum path length pumping lemma for edge-replacement languages
inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_19openalex-snapshot
An Ambiguity Hierarchy of Weighted Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-031-84740-0_5openalex-snapshot
The Pushdown Automaton Model
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_14openalex-snapshot
Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_26openalex-snapshot
Ogden Property for Linear Displacement Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_29openalex-snapshot
Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_5openalex-snapshot
The Strong, Weak, and Very Weak Finite Context and Kernel Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_3openalex-snapshot
Underlying Principles and Recurring Ideas of Formal Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_21openalex-snapshot
On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_62openalex-snapshot
Sublogarithmic Ambiguity
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_17openalex-snapshot
On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids
inferred← citeshttps://doi.org/10.1007/978-3-642-23211-4_4openalex-snapshot
The Generative Power of Probabilistic and Weighted Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_39openalex-snapshot
Ogden’s Lemma for ET0L Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_22openalex-snapshot
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_9openalex-snapshot
Visual Models of Plant Development
inferred← citeshttps://doi.org/10.1007/978-3-642-67081-7_2openalex-snapshot
Reguläre und kontextfreie Sprachen
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_29openalex-snapshot
Quantum Pushdown Automata with a Garbage Tape
inferred← citeshttps://doi.org/10.1007/bf00122312openalex-snapshot
On grammatical complexity of a class of attractors
inferred← citeshttps://doi.org/10.1007/bf00263993openalex-snapshot
An Ogden-like iteration lemma for rational power series
inferred← citeshttps://doi.org/10.1007/bf00264030openalex-snapshot
Sur diverses familles de langages ferm�es par transduction rationnelle
inferred← citeshttps://doi.org/10.1007/bf00288963openalex-snapshot
Ind�pendance forte de certaines op�rations
inferred← citeshttps://doi.org/10.1007/bf00289471openalex-snapshot
Mono�des syntactiques des langages alg�briques
inferred← citeshttps://doi.org/10.1007/bf01683274openalex-snapshot
On languages with a certain prefix property
inferred← citeshttps://doi.org/10.1007/bf01752401openalex-snapshot
Sur une propriété d'itération des langages algébriques déterministes
inferred← citeshttps://doi.org/10.1007/bf01768473openalex-snapshot
Le cylindre des langages linéaires
inferred← citeshttps://doi.org/10.1007/bf01937483openalex-snapshot
On context-free and Szilard languages
inferred← citeshttps://doi.org/10.1007/bf02088014openalex-snapshot
Comparisons between some pumping conditions for context-free languages
inferred← citeshttps://doi.org/10.1007/bf02900420openalex-snapshot
A complexity analysis of the elementary cellular automaton of rule 122
inferred← citeshttps://doi.org/10.1007/bfb0012783openalex-snapshot
An iteration theorem for simple precedence languages
inferred← citeshttps://doi.org/10.1007/bfb0022656openalex-snapshot
On the equivalence of synchronization sets
inferred← citeshttps://doi.org/10.1007/bfb0036907openalex-snapshot
Algebraic languages and polyomnoes enumeration
inferred← citeshttps://doi.org/10.1007/s00224-019-09929-9openalex-snapshot
Additive Number Theory via Automata Theory
inferred← citeshttps://doi.org/10.1007/s00236-012-0169-8openalex-snapshot
Accepting splicing systems with permitting and forbidding words
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90103-0openalex-snapshot
A simplified proof of parikh's theorem
inferred← citeshttps://doi.org/10.1016/0020-0190(74)90050-7openalex-snapshot
The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90016-3openalex-snapshot
A note on the sufficiency of Sokolowski's criterion for context-free languages
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90109-0openalex-snapshot
Permutations are not context-free: An application of the interchange lemma
inferred← citeshttps://doi.org/10.1016/0166-218x(80)90050-5openalex-snapshot
Langages sur des alphabets infinis
inferred← citeshttps://doi.org/10.1016/0304-3975(75)90013-4openalex-snapshot
The Turing degree of the inherent ambiguity problem for context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90033-5openalex-snapshot
Langages algebriques, paires iterantes et transductions rationnelles
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90052-9openalex-snapshot
A strong pumping lemma for context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90015-xopenalex-snapshot
Generateurs algebriques et systemes de paires iterantes
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90029-8openalex-snapshot
Two iteration theorems for the LL(k) languages
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90052-3openalex-snapshot
Iteration theorems for families of strict deterministic languages
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90110-4openalex-snapshot
A pushdown automation or a context-free grammar—which is more economical?
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90116-6openalex-snapshot
Algebraic languages and polyominoes enumeration
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90032-5openalex-snapshot
A pumping lemma for real-time deterministic context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90011-4openalex-snapshot
On satisfying the LL-iteration theorem
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90138-7openalex-snapshot
The interchange or pump (DI)lemmas for context-free languages
inferred← citeshttps://doi.org/10.1016/j.aam.2005.01.002openalex-snapshot
On the growth of linear languages
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.023openalex-snapshot
Unambiguous Boolean grammars
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.024openalex-snapshot
Slender Siromoney matrix languages
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104449openalex-snapshot
Ogden's lemma, multiple context-free grammars, and the control language hierarchy
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.01.018openalex-snapshot
Inverse star, borders, and palstars
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.035openalex-snapshot
On the size complexity of hybrid networks of evolutionary processors
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.10.041openalex-snapshot
Re-examining regular expressions with backreferences
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114112openalex-snapshot
An ambiguity hierarchy of weighted context-free grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(71)90455-4openalex-snapshot
Some inherently ambiguous context-free languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)90864-xopenalex-snapshot
Control sets on linear grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90083-8openalex-snapshot
Locally linear families of languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90642-9openalex-snapshot
Deux Familles de Langages Incomparables
inferred← citeshttps://doi.org/10.1016/s0022-0000(73)80036-4openalex-snapshot
Two iteration theorems for some families of languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80018-8openalex-snapshot
Left-derivation bounded languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80021-8openalex-snapshot
Structure des grammaires d'ambiguïté bornée
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80044-xopenalex-snapshot
Complexity metatheorems for context-free grammar problems
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.1016/s0304-3975(97)00262-4openalex-snapshot
Comparisons of Parikh's condition to other conditions for context-free languages
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80680-7openalex-snapshot
Design and Implementation of the L+C Modeling Language
inferred← citeshttps://doi.org/10.1051/ita/1978120200991openalex-snapshot
Un générateur inhéremment ambigu du cône des langages algébriques
inferred← citeshttps://doi.org/10.1051/ita/1978120301931openalex-snapshot
The family of languages satisfying Bar-Hillel's lemma
inferred← citeshttps://doi.org/10.1051/ita/1978120302011openalex-snapshot
On languages satisfying Ogden's lemma
inferred← citeshttps://doi.org/10.1051/ita/1978120302131openalex-snapshot
The strong independence of substitution and homomorphic replication
inferred← citeshttps://doi.org/10.1051/ita/1979130302031openalex-snapshot
Un langage algébrique particulier
inferred← citeshttps://doi.org/10.1051/ita/1979130403631openalex-snapshot
Quelques problèmes ouverts en théorie des langages algébriques
inferred← citeshttps://doi.org/10.1051/ita/1980140100031openalex-snapshot
Grammaires parenthésées et bilangages réguliers
inferred← citeshttps://doi.org/10.1051/ita/1981150100671openalex-snapshot
A theory of complexity of monadic recursion schemes
inferred← citeshttps://doi.org/10.1051/ita/1986200404251openalex-snapshot
Coordinated pair systems ; part II : sparse structure of Dyck words and Ogden's lemma
inferred← citeshttps://doi.org/10.1051/ita/1986200404571openalex-snapshot
Ogden's lemma for nonterminal bounded languages
inferred← citeshttps://doi.org/10.1051/ita/1993270100711openalex-snapshot
On languages satisfying “interchange Lemma”
inferred← citeshttps://doi.org/10.1080/00207168208803295openalex-snapshot
Sur la structure des langages algébriques
inferred← citeshttps://doi.org/10.1088/0951-7715/12/4/323openalex-snapshot
Complexity of unimodal maps with aperiodic kneading sequences
inferred← citeshttps://doi.org/10.1090/s0002-9947-06-03958-4openalex-snapshot
Growth and ergodicity of context-free languages II: The linear case
inferred← citeshttps://doi.org/10.1093/ietisy/e89-d.3.1120openalex-snapshot
Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition
inferred← citeshttps://doi.org/10.1109/mahc.1981.10006openalex-snapshot
Formal Languages: Origins and Directions
inferred← citeshttps://doi.org/10.1109/sfcs.1979.19openalex-snapshot
Formal languages: Origins and directions
inferred← citeshttps://doi.org/10.1109/sfcs.1979.44openalex-snapshot
The decidability of the equivalence of context-free grammar forms
inferred← citeshttps://doi.org/10.1109/swat.1972.11openalex-snapshot
On sets of numbers recognized by push-down automat
inferred← citeshttps://doi.org/10.1137/0206039openalex-snapshot
Succinctness of Descriptions of Unambiguous Context-Free Languages
inferred← citeshttps://doi.org/10.1137/0207007openalex-snapshot
Computational Parallels between the Regular and Context-Free Languages
inferred← citeshttps://doi.org/10.1142/s0129054106004030openalex-snapshot
ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS
inferred← citeshttps://doi.org/10.1142/s0129054107005340openalex-snapshot
A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES
inferred← citeshttps://doi.org/10.1142/s0129054116500088openalex-snapshot
Remarks on Privileged Words
inferred← citeshttps://doi.org/10.1142/s0129054118500132openalex-snapshot
Quantum Pushdown Automata with Garbage Tape
inferred← citeshttps://doi.org/10.1145/2157.322408openalex-snapshot
An Iteration Theorem for Simple Precedence Languages
inferred← citeshttps://doi.org/10.1145/322307.322315openalex-snapshot
A Generalization of Ogden's Lemma
inferred← citeshttps://doi.org/10.1145/800105.803402openalex-snapshot
Iteration theorems for LL(k) languages (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800116.803753openalex-snapshot
On the complexity of grammar and related problems
inferred← citeshttps://doi.org/10.1145/800157.805043openalex-snapshot
An iteration theorem for one-counter languages.
inferred← citeshttps://doi.org/10.1145/800169.805417openalex-snapshot
The inherent ambiguity partial algorithm problem for context free languages
inferred← citeshttps://doi.org/10.1145/800169.805419openalex-snapshot
Intercalation theorems for stack languages
inferred← citeshttps://doi.org/10.1155/2021/7282245openalex-snapshot
On Fault-Tolerant Partition Dimension of Homogeneous Caterpillar Graphs
inferred← citeshttps://doi.org/10.1162/coli_a_00108openalex-snapshot
On the String Translations Produced by Multi Bottom–Up Tree Transducers
inferred← citeshttps://doi.org/10.18419/opus-2550openalex-snapshot
Ambiguity functions of context-free grammars and languages
inferred← citeshttps://doi.org/10.18419/opus-2706openalex-snapshot
Formal language theory of hairpin formations
inferred← citeshttps://doi.org/10.3233/fi-2015-1198openalex-snapshot
Semilinear Sets and Counter Machines: a Brief Survey
inferred← citeshttps://doi.org/10.3233/fi-2021-2081openalex-snapshot
Coverability, Termination, and Finiteness in Recursive Petri Nets
inferred← citeshttps://doi.org/10.4242/balisagevol5.stuhrenberg01openalex-snapshot
Refining the Taxonomy of XML Schema Languages. A new Approach for Categorizing XML Schema Languages in Terms of Processing Complexity.
inferred← citeshttps://doi.org/10.48550/arxiv.0808.4122openalex-snapshot
Swapping Lemmas for Regular and Context-Free Languages
inferred← citeshttps://doi.org/10.48550/arxiv.0810.4249openalex-snapshot
Ogden's Lemma for Regular Tree Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1207.2819openalex-snapshot
A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1402.3449openalex-snapshot
Quantum Pushdown Automata with a Garbage Tape
inferred← citeshttps://doi.org/10.48550/arxiv.1508.02964openalex-snapshot
Binary words avoiding xx^Rx and strongly unimodal sequences
inferred← citeshttps://doi.org/10.48550/arxiv.chao-dyn/9812016openalex-snapshot
Queues, Stacks, and Transcendentality at the Transition to Chaos
inferred← citeshttps://doi.org/10.70675/1bc4f803z3415z4702z812cz5f57f1ac4da8openalex-snapshot
Exploiting Semantic for the Automatic Reverse Engineering of Communication Protocols.
inferred← citeshttps://doi.org/10.70675/4b2e3e72z109ez4187zaf03z0371e6c18af0openalex-snapshot
Verification of Infinite-State Systems and Machine Learning
inferred← citeshttps://doi.org/10.70675/ce73a4f3z5be9z4ee8z96f8zeab6c61a4477openalex-snapshot
Systèmes de fonctions holonomes : application à la théorie des automates
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.