On the public citation graph

Iterated linear control and iterated one-turn pushdowns

0 signed · 51 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/3-540-06867-8_14openalex-snapshot

Notes on pre-set pushdown automata

inferredcites →https://doi.org/10.1007/3-540-07142-3_84openalex-snapshot

An algebraic formulation of the Chomsky hierarchy

inferredcites →https://doi.org/10.1007/978-3-642-59412-0_24openalex-snapshot

Proof of Correctness of Data Representations

inferredcites →https://doi.org/10.1007/978-3-642-95486-3_8openalex-snapshot

The ETOL Hierarchy is in the oi Hierarchy

inferredcites →https://doi.org/10.1007/bf00289507openalex-snapshot

Proof of correctness of data representations

inferredcites →https://doi.org/10.1007/bf01692513openalex-snapshot

Control sets on grammars

inferredcites →https://doi.org/10.1007/bfb0012764openalex-snapshot

An automata-theoretic characterization of the OI-hierarchy

inferredcites →https://doi.org/10.1016/0022-0000(78)90051-xopenalex-snapshot

IO and OI. II

inferredcites →https://doi.org/10.1016/0022-0000(80)90058-6openalex-snapshot

Tree transducers, L systems, and two-way machines

inferredcites →https://doi.org/10.1016/0022-0000(85)90066-2openalex-snapshot

Macro tree transducers

inferredcites →https://doi.org/10.1016/0304-3975(78)90035-xopenalex-snapshot

One way finite visit automata

inferredcites →https://doi.org/10.1016/0304-3975(82)90003-2openalex-snapshot

Attribute grammars and recursive program schemes I

inferredcites →https://doi.org/10.1016/0304-3975(82)90009-3openalex-snapshot

The IO- and OI-hierarchies

inferredcites →https://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot

Attribute grammars and recursive program schemes II

inferredcites →https://doi.org/10.1016/0304-3975(84)90023-9openalex-snapshot

Linear indexed languages

inferredcites →https://doi.org/10.1016/0304-3975(86)90052-6openalex-snapshot

Pushdown machines for the macro tree transducer

inferredcites →https://doi.org/10.1016/0304-3975(86)90102-7openalex-snapshot

Pushdown machines for the macro tree transducer

inferredcites →https://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.

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(74)90864-xopenalex-snapshot

Control sets on linear grammars

inferredcites →https://doi.org/10.1016/s0019-9958(79)90635-1openalex-snapshot

Bounded nesting in macro grammars

inferredcites →https://doi.org/10.1016/s0019-9958(82)90786-0openalex-snapshot

On the equivalence problem for attribute systems

inferredcites →https://doi.org/10.1016/s0019-9958(86)80016-xopenalex-snapshot

An automata-theoretical characterization of the OI-hierarchy

inferredcites →https://doi.org/10.1016/s0022-0000(67)80014-xopenalex-snapshot

Some definitional suggestions for automata theory

inferredcites →https://doi.org/10.1016/s0022-0000(70)80045-9openalex-snapshot

An hierarchy between context-free and context-sensitive languages

inferredcites →https://doi.org/10.1016/s0022-0000(74)80052-8openalex-snapshot

A geometric hierarchy of languages

inferredcites →https://doi.org/10.1016/s0022-0000(77)80026-3openalex-snapshot

Control sets on context-free grammar forms

inferredcites →https://doi.org/10.1016/s0022-0000(77)80034-2openalex-snapshot

IO and OI. I

inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot

Grammars with macro-like productions

inferredcites →https://doi.org/10.1137/0304034openalex-snapshot

Finite-Turn Pushdown Automata

inferredcites →https://doi.org/10.1145/1008335.1008341openalex-snapshot

Review of "Algebraic and automata-theoretic properties of formal languages" by Seymour Ginsburg. North Holland, 1975.

inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot

Indexed Grammars—An Extension of Context-Free Grammars

inferredcites →https://doi.org/10.1145/321495.321504openalex-snapshot

Programmed Grammars and Classes of Formal Languages

inferredcites →https://doi.org/10.1145/800061.808767openalex-snapshot

Iterated pushdown automata and complexity classes

inferredcites →https://doi.org/10.7146/dpb.v4i47.6466openalex-snapshot

IO and OI

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-45711-9_3openalex-snapshot

The Delta Operation: From Strings to Trees to Strings

inferred← citeshttps://doi.org/10.1007/3-540-45738-0_16openalex-snapshot

Grammars with Composite Storages

inferred← citeshttps://doi.org/10.1007/3-540-51498-8_17openalex-snapshot

Iterated deterministic top-down look-ahead

inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_9openalex-snapshot

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages

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/bfb0028831openalex-snapshot

Iterated linear control and iterated one-turn pushdowns

inferred← citeshttps://doi.org/10.1007/s00224-007-9053-2openalex-snapshot

Storage Products and Linear Control of Derivations

inferred← citeshttps://doi.org/10.1007/s00236-018-0325-xopenalex-snapshot

Weighted iterated linear control

inferred← citeshttps://doi.org/10.1016/0304-3975(92)90124-xopenalex-snapshot

A geometric hierarchy beyond context-free languages

inferred← citeshttps://doi.org/10.1016/0890-5401(88)90026-0openalex-snapshot

The OI-hierarchy is closed under control

inferred← citeshttps://doi.org/10.1016/0890-5401(91)90015-topenalex-snapshot

Iterated stack automata and complexity classes

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00285-1openalex-snapshot

L(A)=L(B)? decidability results from complete formal systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00106-1openalex-snapshot

Complete formal systems for equivalence problems

inferred← citeshttps://doi.org/10.1023/a:1009924903938openalex-snapshot

On the Concatenation of One–Turn Pushdowns

inferred← citeshttps://doi.org/10.1111/j.1467-8640.1994.tb00007.xopenalex-snapshot

LINEAR ITERATED PUSHDOWNS

inferred← citeshttps://doi.org/10.48550/arxiv.1408.0683openalex-snapshot

Context-Free Grammars with Storage

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.