On the public citation graph
Formal properties of natural language and linguistic theories
0 signed · 32 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.1007/3-540-06867-8_1openalex-snapshot
Theory of L systems: From the point of view of formal language theory
inferredcites →https://doi.org/10.1007/978-1-4615-3170-8_2openalex-snapshot
Towards Transductive Linguistics
inferredcites →https://doi.org/10.1007/978-94-009-3401-6openalex-snapshot
The Formal Complexity of Natural Language
inferredcites →https://doi.org/10.1007/978-94-009-3401-6_4openalex-snapshot
On Constraining the Class of Transformational Languages
inferredcites →https://doi.org/10.1007/978-94-009-3401-6_9openalex-snapshot
On some Formal Properties of Metarules
inferredcites →https://doi.org/10.1007/bf00485408openalex-snapshot
On constraining the class of transformational languages
inferredcites →https://doi.org/10.1007/bf00603219openalex-snapshot
On some formal properties of metarules
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1017/cbo9780511597855.007openalex-snapshot
Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions?
inferredcites →https://doi.org/10.1075/cilt.75.08steopenalex-snapshot
6. Generalized Phrase Structure Grammar
inferredcites →https://doi.org/10.1075/z.35.16rouopenalex-snapshot
Finding Natural Languages a Home in Formal Language Theory
inferredcites →https://doi.org/10.1145/1008861.1008863openalex-snapshot
Review of "Introduction to automata theory, languages and computation" by John E. Hopcroft and Jeffrey D. Ullman. Addison-Wesley 1979.
inferredcites →https://doi.org/10.1353/lan.1990.0015openalex-snapshot
The X-bar theory of phrase structure
inferredcites →https://doi.org/10.1515/9783110884166openalex-snapshot
Lectures on Government and Binding
inferredcites →https://doi.org/10.2307/2185122openalex-snapshot
Generalized Phrase Structure Grammar.
inferredcites →https://doi.org/10.2307/2185417openalex-snapshot
Knowledge of Language: Its Nature, Origin, and Use.
inferredcites →https://doi.org/10.2307/413646openalex-snapshot
Lectures on government and binding . By Noam Chomsky. (Studies in generative grammar, 9.) Dordrecht, Holland, & Cinnaminson, NJ: Foris, 1981. Pp. 371. Cloth f 90.00, paper f 50.00. - Some concepts and consequences of the theory of government and binding . By Noam Chomsky. (Linguistic Inquiry…
inferredcites →https://doi.org/10.3115/981131.981138openalex-snapshot
Defining natural language grammars in GPSG
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_20openalex-snapshot
Deleting Deterministic Restarting Automata with Two Windows
inferred← citeshttps://doi.org/10.1007/978-3-319-94631-3_2openalex-snapshot
Properties of Right One-Way Jumping Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_12openalex-snapshot
Deterministic Input-Reversal and Input-Revolving Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_33openalex-snapshot
On Stateless Deterministic Restarting Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_3openalex-snapshot
Gaining Power by Input Operations: Finite Automata and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-642-31644-9_8openalex-snapshot
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata
inferred← citeshttps://doi.org/10.1007/s00236-010-0125-4openalex-snapshot
On stateless deterministic restarting automata
inferred← citeshttps://doi.org/10.1007/s00236-012-0175-xopenalex-snapshot
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.002openalex-snapshot
On input-revolving deterministic and nondeterministic finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.044openalex-snapshot
Properties of right one-way jumping finite automata
inferred← citeshttps://doi.org/10.1023/a:1009926918246openalex-snapshot
Statistical Distribution and the Grammatical/Ungrammatical Distinction
inferred← citeshttps://doi.org/10.1142/s012905412244004xopenalex-snapshot
Reversible Top-Down Syntax Analysis
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.