On the public citation graph
Hierarchy theorems for two-way finite state transducers
0 signed · 42 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/bf00985664openalex-snapshot
Extension of tabled 0L-systems and languages
inferredcites →https://doi.org/10.1016/0304-3975(78)90035-xopenalex-snapshot
One way finite visit automata
inferredcites →https://doi.org/10.1016/s0019-9958(70)80039-0openalex-snapshot
Full AFLs and nested iterated substitution
inferredcites →https://doi.org/10.1016/s0019-9958(71)90483-9openalex-snapshot
Two-way sequential transductions and stack automata
inferredcites →https://doi.org/10.1016/s0019-9958(75)90159-xopenalex-snapshot
Bounded-crossing transducers
inferredcites →https://doi.org/10.1016/s0019-9958(78)90289-9openalex-snapshot
Visits, crosses, and reversals for nondeterministic off-line machines
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(70)80027-7openalex-snapshot
A characterization of two-way deterministic classes of languages
inferredcites →https://doi.org/10.1016/s0022-0000(71)80024-7openalex-snapshot
AFL with the semilinear property
inferredcites →https://doi.org/10.1016/s0022-0000(72)80025-4openalex-snapshot
Absolutely parallel grammars and two-way finite-state transducers
inferredcites →https://doi.org/10.1016/s0022-0000(72)80038-2openalex-snapshot
Substitution and bounded languages
inferredcites →https://doi.org/10.1016/s0022-0000(72)80039-4openalex-snapshot
Syntactic operators on full semiAFLs
inferredcites →https://doi.org/10.1016/s0022-0000(75)80017-1openalex-snapshot
Two-way a-transducers and AFL
inferredcites →https://doi.org/10.1090/memo/0087openalex-snapshot
Studies in abstract families of languages
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1137/0205022openalex-snapshot
Decomposition Theorems for Various Kinds of Languages Parallel in Nature
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars
inferredcites →https://doi.org/10.1145/321495.321503openalex-snapshot
An Infinite Hierarchy of Context-Free Languages
inferredcites →https://doi.org/10.1145/322169.322178openalex-snapshot
Stack Machines and Classes of Nonnested Macro Languages
inferredcites →https://doi.org/10.1145/800133.804333openalex-snapshot
Tree transducers, L systems and two-way machines (Extended Abstract)
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.1147/rd.32.0198openalex-snapshot
The Reduction of Two-Way Automata to One-Way Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.2001.1816openalex-snapshot
Output String Languages of Compositions of Deterministic Macro Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_28openalex-snapshot
Two-way finite state transducers and monadic second-order logic
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_29openalex-snapshot
Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_8openalex-snapshot
The ETOL Hierarchy is in the oi Hierarchy
inferred← citeshttps://doi.org/10.1007/s00224-014-9534-zopenalex-snapshot
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90006-6openalex-snapshot
Hierarchies of hyper-AFLs
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90103-4openalex-snapshot
Representations of language families by homomorphic equality operations and generalized equality sets
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90015-topenalex-snapshot
Iterated stack automata and complexity classes
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50014-2openalex-snapshot
SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104449openalex-snapshot
Ogden's lemma, multiple context-free grammars, and the control language hierarchy
inferred← citeshttps://doi.org/10.1145/371316.371512openalex-snapshot
MSO definable string transductions and two-way finite-state transducers
inferred← citeshttps://doi.org/10.1145/800133.804333openalex-snapshot
Tree transducers, L systems and two-way machines (Extended Abstract)
inferred← citeshttps://doi.org/10.13130/guillon-bruno_phd2016-05-30openalex-snapshot
Two-wayness: Automata and Transducers
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.