On the public citation graph

Some restrictions onW-grammars

https://doi.org/10.1007/bf00978977
0 signed · 31 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/978-3-642-48895-5openalex-snapshot
Mathematical Systems Theory
inferredcites →https://doi.org/10.1007/bf01705890openalex-snapshot
Quasi-realtime languages
inferredcites →https://doi.org/10.1007/bf01762237openalex-snapshot
An infinite hierarchy of intersections of context-free languages
inferredcites →https://doi.org/10.1007/bf02163002openalex-snapshot
Report on the Algorithmic Language ALGOL 68
inferredcites →https://doi.org/10.1016/b978-1-4831-9779-1.50019-7openalex-snapshot
Report on the Algorithmic Language ALGOL 60
inferredcites →https://doi.org/10.1016/s0019-9958(69)90312-xopenalex-snapshot
Property grammars and table machines
inferredcites →https://doi.org/10.1016/s0019-9958(69)90334-9openalex-snapshot
A note on enumerable grammars
inferredcites →https://doi.org/10.1016/s0019-9958(71)90164-1openalex-snapshot
On 0L-Languages
inferredcites →https://doi.org/10.1016/s0022-0000(71)80025-9openalex-snapshot
Time-bounded grammars and their languages
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0135681-9openalex-snapshot
Linear Automaton Transformations
inferredcites →https://doi.org/10.1093/comjnl/5.4.349openalex-snapshot
Revised report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1109/focs.1967.35openalex-snapshot
Turing machines with several read-write heads
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1145/321127.321132openalex-snapshot
Two Families of Languages Related to ALGOL
inferredcites →https://doi.org/10.1145/321386.321403openalex-snapshot
One-way stack automata
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars
inferredcites →https://doi.org/10.1145/321526.321529openalex-snapshot
Nested Stack Automata
inferredcites →https://doi.org/10.1145/356596.356598openalex-snapshot
The Vienna Definition Language
inferredcites →https://doi.org/10.1145/366193.366201openalex-snapshot
Revised report on the algorithmic language ALGOL 60

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-08353-7_160openalex-snapshot
Two-level meta-controlled substitution grammars
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_56openalex-snapshot
Languages with homomorphic replacements
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_4openalex-snapshot
Aspects of Classical Language Theory
inferred← citeshttps://doi.org/10.1007/bf00265677openalex-snapshot
Two-level meta-controlled substitution grammars
inferred← citeshttps://doi.org/10.1007/bf00289076openalex-snapshot
On the complexity of formal grammars
inferred← citeshttps://doi.org/10.1007/s11042-015-2898-5openalex-snapshot
A grammar based approach to introduce the Semantic Web to novice users
inferred← citeshttps://doi.org/10.1016/0020-0255(79)90004-5openalex-snapshot
Parallelism and synchronization in two-level metacontrolled substitution grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90100-6openalex-snapshot
Languages with homomorphic replacements
inferred← citeshttps://doi.org/10.1016/1385-7258(77)90045-2openalex-snapshot
Recursively enumerable languages and van Wijngaarden grammars
inferred← citeshttps://doi.org/10.1016/1385-7258(78)90031-8openalex-snapshot
On characterization of recursively enumerable languages in terms of linear languages and VW-grammars
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
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.