On the public citation graph
The theory of languages
0 signed · 104 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.1002/j.1538-7305.1967.tb03172.xopenalex-snapshot
An Approach to a Unified Theory of Automata
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(59)90362-6openalex-snapshot
On certain formal properties of grammars
inferredcites →https://doi.org/10.1016/s0019-9958(60)90965-7openalex-snapshot
Note on the boolean properties of context free languages
inferredcites →https://doi.org/10.1016/s0019-9958(62)90244-9openalex-snapshot
Finite counting automata
inferredcites →https://doi.org/10.1016/s0019-9958(63)90149-9openalex-snapshot
The undecidability of the ambiguity problem for minimal linear grammars
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/s0019-9958(64)90342-0openalex-snapshot
Note on the complement of a (minimal) linear language
inferredcites →https://doi.org/10.1016/s0019-9958(64)90422-xopenalex-snapshot
Inherent ambiguity of minimal linear grammars
inferredcites →https://doi.org/10.1016/s0019-9958(65)90426-2openalex-snapshot
On the translation of languages from left to right
inferredcites →https://doi.org/10.1016/s0019-9958(66)80016-5openalex-snapshot
Mappings which preserve context sensitive languages
inferredcites →https://doi.org/10.1016/s0019-9958(66)80019-0openalex-snapshot
Deterministic context free languages
inferredcites →https://doi.org/10.1016/s0019-9958(67)80007-xopenalex-snapshot
Recognition and parsing of context-free languages in time n3
inferredcites →https://doi.org/10.1016/s0019-9958(67)90369-5openalex-snapshot
Two-way pushdown automata
inferredcites →https://doi.org/10.1016/s0019-9958(67)90591-8openalex-snapshot
A regularity test for pushdown machines
inferredcites →https://doi.org/10.1016/s0022-0000(67)80013-8openalex-snapshot
Nonerasing stack automata
inferredcites →https://doi.org/10.1016/s0022-0000(68)80003-0openalex-snapshot
Deterministic stack automata and the quotient operator
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-9904-1946-08555-9openalex-snapshot
A variant of a recursively unsolvable problem
inferredcites →https://doi.org/10.1090/s0002-9947-1964-0181500-1openalex-snapshot
Bounded 𝐴𝐿𝐺𝑂𝐿-like languages
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1109/focs.1965.11openalex-snapshot
Hierarchies of memory limited computations
inferredcites →https://doi.org/10.1109/focs.1965.14openalex-snapshot
Memory bounds for recognition of context-free and context-sensitive languages
inferredcites →https://doi.org/10.1109/focs.1967.16openalex-snapshot
Indexed grammars -- An extension of context free grammars
inferredcites →https://doi.org/10.1109/focs.1967.28openalex-snapshot
Programmed grammars -- A new device for generating formal languages
inferredcites →https://doi.org/10.1109/focs.1967.37openalex-snapshot
Two results on one-way stack automata
inferredcites →https://doi.org/10.1109/pgec.1964.263814openalex-snapshot
The Syntax of Programming Languages-A Survey
inferredcites →https://doi.org/10.1109/pgec.1964.263815openalex-snapshot
Decision Problems of Phrase-Structure Grammars
inferredcites →https://doi.org/10.1109/tec.1962.5219345openalex-snapshot
Examples of Abstract Machines
inferredcites →https://doi.org/10.1109/tec.1962.5219459openalex-snapshot
Real-Time Computation and Recursive Functions Not Real-Time Computable
inferredcites →https://doi.org/10.1109/tit.1956.1056813openalex-snapshot
Three models for the description of language
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1112/plms/s2-43.6.544openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
inferredcites →https://doi.org/10.1145/1463822.1463848openalex-snapshot
Application of pushdown-store machines
inferredcites →https://doi.org/10.1145/321127.321132openalex-snapshot
Two Families of Languages Related to ALGOL
inferredcites →https://doi.org/10.1145/321138.321145openalex-snapshot
On The Ambiguity Problem of Backus Systems
inferredcites →https://doi.org/10.1145/321150.321153openalex-snapshot
Some Recursively Unsolvable Problems in ALGOL-Like Languages
inferredcites →https://doi.org/10.1145/321160.321167openalex-snapshot
Operations Which Preserve Definability in Languages
inferredcites →https://doi.org/10.1145/321186.321191openalex-snapshot
Quotients of Context-Free Languages
inferredcites →https://doi.org/10.1145/321250.321254openalex-snapshot
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
inferredcites →https://doi.org/10.1145/321312.321318openalex-snapshot
Ambiguity in context free languages
inferredcites →https://doi.org/10.1145/321341.321345openalex-snapshot
Preservation of unambiguity and inherent ambiguity in context-free languages
inferredcites →https://doi.org/10.1145/321356.321362openalex-snapshot
Two-Tape Simulation of Multitape Turing Machines
inferredcites →https://doi.org/10.1145/321356.321365openalex-snapshot
The Unsolvability of the Recognition of Linear Context-Free Languages
inferredcites →https://doi.org/10.1145/321356.321366openalex-snapshot
The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages
inferredcites →https://doi.org/10.1145/321406.321412openalex-snapshot
Matrix Equations and Normal Forms for Context-Free Grammars
inferredcites →https://doi.org/10.1145/321450.321463openalex-snapshot
Decidable and Undecidable Questions About Automata
inferredcites →https://doi.org/10.1145/321466.321474openalex-snapshot
Relations Between Time and Tape Complexities
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars
inferredcites →https://doi.org/10.1145/321556.321558openalex-snapshot
Two-way balloon automata and AFL
inferredcites →https://doi.org/10.1145/365691.365962openalex-snapshot
Multi-tape and infinite-state automata—a survey
inferredcites →https://doi.org/10.1145/368959.368993openalex-snapshot
On ambiguity in phrase structure languages
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
inferredcites →https://doi.org/10.2307/2269904openalex-snapshot
Noam Chomsky and George A. Miller. Introduction to the formal analysis of natural languages. Handbook of mathematical psychology, Volume II, edited by R. Duncan Luce, Robert R. Bush, and Eugene Galanter, John Wiley and Sons, Inc., New York and London1963, pp. 269–321. - Noam Chomsky. Formal…
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
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-07854-1_212openalex-snapshot
On divergence problem for program schemas
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_86openalex-snapshot
On divergence and halting problems for monadic program schemas
inferred← citeshttps://doi.org/10.1007/978-1-4899-5841-9_3openalex-snapshot
Semantics of Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-01476-6_3openalex-snapshot
A Language of Terms of Taylor’s Formula for Quadratic Dynamical Systems and Its Fractality
inferred← citeshttps://doi.org/10.1007/978-3-642-65363-6_4openalex-snapshot
Markov-Prozesse mit endlichvielen Zuständen
inferred← citeshttps://doi.org/10.1007/978-3-642-93048-5_7openalex-snapshot
Formal Languages as Models for Biological Growth
inferred← citeshttps://doi.org/10.1007/bf01030718openalex-snapshot
Certain classes of discrete controlled systems and languages (algorithmic problems)
inferred← citeshttps://doi.org/10.1007/bf01068513openalex-snapshot
Generalized transformation grammars
inferred← citeshttps://doi.org/10.1007/bf01071355openalex-snapshot
Theory of automata and certain problems of synthesizing the structures of language processors
inferred← citeshttps://doi.org/10.1007/bf01702868openalex-snapshot
A note on some systems of lindenmayer
inferred← citeshttps://doi.org/10.1007/bf01762180openalex-snapshot
On the uniqueness of the equilibrium state
inferred← citeshttps://doi.org/10.1007/bf02234250openalex-snapshot
Über einen Automaten mit Pufferspeicherung
inferred← citeshttps://doi.org/10.1007/s10884-024-10370-xopenalex-snapshot
Exponential Mixing for Heterochaos Baker Maps and the Dyck System
inferred← citeshttps://doi.org/10.1007/s10955-025-03486-xopenalex-snapshot
Ergodic Optimization for Continuous Functions on the Dyck-Motzkin Shifts
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90027-1openalex-snapshot
Interdependent translation schemes
inferred← citeshttps://doi.org/10.1016/0022-5193(71)90002-6openalex-snapshot
Developmental systems without cellular interactions, their languages and grammars
inferred← citeshttps://doi.org/10.1016/b978-0-08-041897-1.50062-6openalex-snapshot
PRODUCT MODELING: FROM GEOMETRICAL MODELING TO LOGICAL MODELING
inferred← citeshttps://doi.org/10.1016/b978-0-12-696202-4.50017-6openalex-snapshot
On Syntactic Pattern Recognition
inferred← citeshttps://doi.org/10.1016/s0019-9958(70)90224-xopenalex-snapshot
The parsing for general phrase-structure grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(70)90440-7openalex-snapshot
The state complexity of Turing machines
inferred← citeshttps://doi.org/10.1016/s0019-9958(72)90205-7openalex-snapshot
Language recognition by marking automata
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70391-xopenalex-snapshot
On the Formalizability of Learning and Evolution
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70394-5openalex-snapshot
Cellular Automata, Formal Languages and Developmental Systems
inferred← citeshttps://doi.org/10.1016/s0076-5392(09)60461-6openalex-snapshot
Chapter 2 Introduction to Formal Languages
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)52387-3openalex-snapshot
Product Modeling: From Geometrical Modeling to Logical Modeling
inferred← citeshttps://doi.org/10.1017/s002190020004780xopenalex-snapshot
A Stochastic Automaton Model for Interacting Systems
inferred← citeshttps://doi.org/10.1017/s1446788700014373openalex-snapshot
C*-algebras associated with presentations of subshifts ii. ideal structure and lambda-graph subsystems
inferred← citeshttps://doi.org/10.1090/proc/16538openalex-snapshot
Heterochaos baker maps and the Dyck system: Maximal entropy measures and a mechanism for the breakdown of entropy approachability
inferred← citeshttps://doi.org/10.1109/tevc.2008.2009063openalex-snapshot
Search, Neutral Evolution, and Mapping in Evolutionary Computing: A Case Study of Grammatical Evolution
inferred← citeshttps://doi.org/10.1142/s0129167x05002849openalex-snapshot
K-THEORETIC INVARIANTS AND CONFORMAL MEASURES OF THE DYCK SHIFTS
inferred← citeshttps://doi.org/10.4324/9781003027461-8openalex-snapshot
Criteria for Constructing Optimal Digital Terrain Models
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/6335openalex-snapshot
Discrete Event Systems based Design Patterns for Diagnosability Analysis of Automated Manufacturing Systems
inferred← citeshttps://doi.org/10.70675/845af9fbzc4c7z4649zacc4z4d829374016dopenalex-snapshot
Native support for parallel and distributed computing by the network
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.