On the public citation graph

Strict LT2 : Regular :: Local : Recognizable

https://doi.org/10.1007/bfb0052167
0 signed · 37 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.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/978-94-015-8879-9_2openalex-snapshot
Modal Logic and Model-Theoretic Syntax
inferredcites →https://doi.org/10.1007/bf01048404openalex-snapshot
Syntactic codes and grammar refinement
inferredcites →https://doi.org/10.1007/bf01049475openalex-snapshot
Syntactic codes and grammar refinement
inferredcites →https://doi.org/10.1016/s0019-9958(67)90353-1openalex-snapshot
Algebraic automata and context-free sets
inferredcites →https://doi.org/10.1016/s0022-0000(67)80022-9openalex-snapshot
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
inferredcites →https://doi.org/10.1016/s0022-0000(70)80041-1openalex-snapshot
Tree acceptors and some of their applications
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-1961-0139530-9openalex-snapshot
Decision problems of finite automata design and related arithmetics
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.2307/1993511openalex-snapshot
Decision Problems of Finite Automata Design and Related Arithmetics
inferredcites →https://doi.org/10.2307/1995086openalex-snapshot
Decidability of Second-Order Theories and Automata on Infinite Trees
inferredcites →https://doi.org/10.2307/2218270openalex-snapshot
Computer Programming and Formal Systems.
inferredcites →https://doi.org/10.3115/976744.976748openalex-snapshot
Talking about trees
inferredcites →https://doi.org/10.3138/9781487592769-008openalex-snapshot
Explicit Definitions and Linguistic Dominoes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119598732.ch5openalex-snapshot
The Chomsky Hierarchy 1
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_26openalex-snapshot
Input Strictly Local Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-14322-9_7openalex-snapshot
Some Interdefinability Results for Syntactic Constraint Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-14729-6_6openalex-snapshot
Formal Parameters of Phonology
inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_7openalex-snapshot
Learning Tree Languages
inferred← citeshttps://doi.org/10.1007/bfb0052150openalex-snapshot
Inessential features
inferred← citeshttps://doi.org/10.1007/s10849-007-9052-3openalex-snapshot
Inessential Features, Ineliminable Features, and Modal Logics for Model Theoretic Syntax
inferred← citeshttps://doi.org/10.1007/s10849-023-09398-xopenalex-snapshot
Relativized Adjacency
inferred← citeshttps://doi.org/10.1162/tacl_a_00260openalex-snapshot
Autosegmental Input Strictly Local Functions
inferred← citeshttps://doi.org/10.18653/v1/w17-34openalex-snapshot
Proceedings of the 15th Meeting on the Mathematics of Language
inferred← citeshttps://doi.org/10.18653/v1/w17-3403openalex-snapshot
On the Logical Complexity of Autosegmental Representations
inferred← citeshttps://doi.org/10.18653/v1/w18-58openalex-snapshot
Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology
inferred← citeshttps://doi.org/10.18653/v1/w18-5817openalex-snapshot
Sanskrit n-Retroflexion is Input-Output Tier-Based Strictly Local
inferred← citeshttps://doi.org/10.18653/v1/w19-4216openalex-snapshot
Unbounded Stress in Subregular Phonology
inferred← citeshttps://doi.org/10.21248/hpsg.2019.4openalex-snapshot
What grammars are, or ought to be
inferred← citeshttps://doi.org/10.2200/s00643ed1v01y201504hlt028openalex-snapshot
Grammatical Inference for Computational Linguistics
inferred← citeshttps://doi.org/10.3765/amp.v7i0.4476openalex-snapshot
Tone Association and Output Locality in Non-Linear Structures
inferred← citeshttps://doi.org/10.3765/amp.v8i0.4676openalex-snapshot
The computational nature of stress assignment
inferred← citeshttps://doi.org/10.3765/amp.v8i0.4679openalex-snapshot
Representation and the Computation of Long Distance Tone Processes
inferred← citeshttps://doi.org/10.3765/amp.v9i0.4920openalex-snapshot
Computational Restrictions on Iterative Prosodic Processes
inferred← citeshttps://doi.org/10.48550/arxiv.1908.08132openalex-snapshot
Tensor Product Representations of Subregular Formal Languages
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.