On the public citation graph

On the complexity of formal grammars

https://doi.org/10.1007/bf00289076
0 signed · 34 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-06841-4_50openalex-snapshot
Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/bf00264470openalex-snapshot
General properties of derivational complexity
inferredcites →https://doi.org/10.1007/bf00976059openalex-snapshot
On the structure of context-sensitive grammars
inferredcites →https://doi.org/10.1007/bf00978977openalex-snapshot
Some restrictions onW-grammars
inferredcites →https://doi.org/10.1016/0020-0190(75)90027-7openalex-snapshot
The membership question for ETOL-languages is polynomially complete
inferredcites →https://doi.org/10.1016/0304-3975(76)90057-8openalex-snapshot
Translational lemmas, polynomial time, and (log n)j-space
inferredcites →https://doi.org/10.1016/0376-5075(81)90061-1openalex-snapshot
1981 international computing symposium
inferredcites →https://doi.org/10.1016/s0019-9958(63)90169-4openalex-snapshot
Three theorems on phrase structure grammars of type 1
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/s0022-0000(69)80012-7openalex-snapshot
Checking automata and one-way stack languages
inferredcites →https://doi.org/10.1016/s0022-0000(71)80025-9openalex-snapshot
Time-bounded grammars and their languages
inferredcites →https://doi.org/10.1016/s0022-0000(73)80044-3openalex-snapshot
On the extension of Gladkij's Theorem and the Hierarchies of languages
inferredcites →https://doi.org/10.1016/s0022-0000(74)80008-5openalex-snapshot
Comparing complexity classes
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1109/swat.1973.5openalex-snapshot
Complexity of recognition in intermediate Level languages
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1997.2681openalex-snapshot
Growing Context-Sensitive Languages and Church–Rosser Languages
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_65openalex-snapshot
On growing context-sensitive languages
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_83openalex-snapshot
Growing context-sensitive languages and Church-Rosser languages
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_88openalex-snapshot
On weak growing context-sensitive grammars
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-031-40247-0_14openalex-snapshot
Sweeping Input-Driven Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-94-011-1628-2_30openalex-snapshot
Electrochemical Behaviour of Complexes Derived from the Activation of Alkynes, Isocyanides and Nitriles
inferred← citeshttps://doi.org/10.1007/bfb0022661openalex-snapshot
Membership for growing context sensitive grammars is polynomial
inferred← citeshttps://doi.org/10.1007/bfb0035847openalex-snapshot
On polynomial time graph grammars
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90062-0openalex-snapshot
Membership for growing context-sensitive grammars is polynomial
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90042-3openalex-snapshot
Manipulating derivation forests by scheduling techniques
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90697-1openalex-snapshot
A remark on tally languages and complexity classes
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00054-1openalex-snapshot
The ancestor width of grammars and languages
inferred← citeshttps://doi.org/10.1093/obo/9780199772810-0029openalex-snapshot
Mathematical Linguistics
inferred← citeshttps://doi.org/10.1142/s0129054125410072openalex-snapshot
Sweeping Input-Driven Pushdown Automata
inferred← citeshttps://doi.org/10.3115/992424.992454openalex-snapshot
Uniform recognition for acyclic context-sensitive grammars is NP-complete
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.