On the public citation graph
An infinite hierarchy of intersections of context-free languages
0 signed · 61 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.1016/s0019-9958(64)90120-2openalex-snapshot
Classes of languages and linear-bounded automata
inferredcites →https://doi.org/10.1016/s0049-237x(08)72023-8openalex-snapshot
The Algebraic Theory of Context-Free Languages
inferredcites →https://doi.org/10.1090/s0002-9947-1964-0181500-1openalex-snapshot
Bounded 𝐴𝐿𝐺𝑂𝐿-like languages
inferredcites →https://doi.org/10.1145/1463822.1463848openalex-snapshot
Application of pushdown-store machines
inferredcites →https://doi.org/10.2140/pjm.1966.16.285openalex-snapshot
Semigroups, Presburger formulas, and languages
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.2000.1742openalex-snapshot
The Descriptive Complexity Approach to LOGCFL
inferred← citeshttps://doi.org/10.1007/11779148_23openalex-snapshot
The Boolean Closure of Growing Context-Sensitive Languages
inferred← citeshttps://doi.org/10.1007/3-540-06473-7_11openalex-snapshot
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_190openalex-snapshot
A hierarchy of context-sensitive languages
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_65openalex-snapshot
On growing context-sensitive languages
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_40openalex-snapshot
Behavioral Strengths and Weaknesses of Various Models of Limited Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_24openalex-snapshot
Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_25openalex-snapshot
Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_45openalex-snapshot
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-08123-6_18openalex-snapshot
Languages Associated with Crystallographic Symmetry
inferred← citeshttps://doi.org/10.1007/978-3-319-68167-2openalex-snapshot
Automated Technology for Verification and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-68167-2_24openalex-snapshot
A Language-Theoretic View on Network Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_24openalex-snapshot
The Boolean Closure of Linear Context-Free Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_7openalex-snapshot
On Context-Sensitive Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_7openalex-snapshot
Extensional Uniformity for Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_36openalex-snapshot
Models of Pushdown Automata with Reset
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_4openalex-snapshot
Aspects of Classical Language Theory
inferred← citeshttps://doi.org/10.1007/bf00288645openalex-snapshot
Context-free grammars with selective rewriting
inferred← citeshttps://doi.org/10.1007/bf00289069openalex-snapshot
Intersections de langages alg�briques born�s
inferred← citeshttps://doi.org/10.1007/bf01683276openalex-snapshot
Observations about bounded languages and developmental systems
inferred← citeshttps://doi.org/10.1007/bf01776563openalex-snapshot
Refining nondeterminism in context-free languages
inferred← citeshttps://doi.org/10.1007/s00236-007-0068-6openalex-snapshot
The Boolean closure of linear context-free languages
inferred← citeshttps://doi.org/10.1007/s11047-015-9527-0openalex-snapshot
Counter machines and crystallographic structures
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90030-2openalex-snapshot
Nondeterminism and boolean operations in pda's
inferred← citeshttps://doi.org/10.1016/b978-0-12-037102-0.50010-8openalex-snapshot
On Learning Smullyan's Elementary Formal Systems: Towards an Efficient Learning Method for Context-Sensitive Languages* *This work forms part of the major R&D on the Fifth Generation Computer Project, conducted under a program set up by MITI.
inferred← citeshttps://doi.org/10.1016/b978-0-12-775260-0.50017-7openalex-snapshot
RECOGNITION OF FUZZY LANGUAGES
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105358openalex-snapshot
Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.12.006openalex-snapshot
The dissecting power of regular languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.029openalex-snapshot
On state-alternating context-free grammars
inferred← citeshttps://doi.org/10.1016/s0022-0000(77)80012-3openalex-snapshot
Degree-languages: A new concept of acceptance
inferred← citeshttps://doi.org/10.1016/s0022-0000(77)80016-0openalex-snapshot
Direct or cascade product of pushdown automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00028-5openalex-snapshot
Dynamical recognizers: real-time language recognition by analog computers
inferred← citeshttps://doi.org/10.1023/a:1014219530875openalex-snapshot
Top-Down Parsing of Conjunctive Languages
inferred← citeshttps://doi.org/10.1051/ita/1977110100291openalex-snapshot
Cônes rationnels commutativement clos
inferred← citeshttps://doi.org/10.1080/23799927.2023.2166872openalex-snapshot
Between SC and LOGDCFL: families of languages accepted by logarithmic-space deterministic auxiliary depth-k storage automata
inferred← citeshttps://doi.org/10.1109/32.56100openalex-snapshot
Specifying Ada server tasks with executable formal grammars
inferred← citeshttps://doi.org/10.1137/0203024openalex-snapshot
Existence of Graphs with Three Spanning Trees and Given Degree Sequence
inferred← citeshttps://doi.org/10.1137/0210010openalex-snapshot
On String Pattern Matching: A New Model with a Polynomial Time Algorithm
inferred← citeshttps://doi.org/10.1137/080741811openalex-snapshot
Extensional Uniformity for Boolean Circuits
inferred← citeshttps://doi.org/10.1142/9789812562494_0064openalex-snapshot
AN OVERVIEW OF CONJUNCTIVE GRAMMARS
inferred← citeshttps://doi.org/10.1145/567752.567773openalex-snapshot
String pattern matching in polynomial time
inferred← citeshttps://doi.org/10.1145/800116.803763openalex-snapshot
Degree-languages, polynomial time recognition, and the LBA problem
inferred← citeshttps://doi.org/10.1145/800119.803903openalex-snapshot
Some restrictions on W-grammars
inferred← citeshttps://doi.org/10.1145/800119.803906openalex-snapshot
Intersections of linear context-free languages and reversal-bounded multipushdown machines (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800161.805150openalex-snapshot
Complexity problems in real time computation
inferred← citeshttps://doi.org/10.3233/fi-2011-587openalex-snapshot
Growing Grammars and Length-reducing Automata
inferred← citeshttps://doi.org/10.3233/fun-2008-892-305openalex-snapshot
The Boolean Closure of Growing Context-Sensitive Languages
inferred← citeshttps://doi.org/10.46298/dmtcs.9063openalex-snapshot
Dissecting power of intersection of two context-free languages
inferred← citeshttps://doi.org/10.48550/arxiv.2111.05000openalex-snapshot
Behavioral Strengths and Weaknesses of Various Models of Limited Automata
inferred← citeshttps://doi.org/10.5441/002/icdt.2014.15openalex-snapshot
Conjunctive Context-Free Path Queries
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.