An Approach to a Unified Theory of Automata

Cited in

(45)

Extended macro grammars and stack controlled machines
On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
On locating minimum feedback vertex sets
On generalized zeta functions of formal languages and series
A note on the space complexity of some decision problems for finite automata
Iterated stack automata and complexity classes
\(X\)-automata on \(\omega\)-words
Automatic correction of syntax-errors in programming languages
Abstract families of length-preserving processors
Periodicities on trees
Equational derivation vs. computation
Query automata over finite trees
The power of two-way deterministic checking stack automata
Linear weighted tree automata with storage and inverse linear tree homomorphisms
Automata equipped with auxiliary data structures and regular realizability problems
A generalized mathematical theory of structured programming
Deterministic stack automata and the quotient operator
What makes some language theory problems undecidable
Writing pushdown acceptors
Time- and tape-bounded Turing acceptors and AFLs
Abstract families of processors
A characterization of two-way deterministic classes of languages
Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
The many faces of a translation
One-way acceptors and languages
AUTOMATA AND DIGITAL COMPUTERS
The derivational complexity of string rewriting systems
On restarting automata with auxiliary symbols and small window size
Lexicalized syntactic analysis by two-way restarting automata
The theory of languages
A general theory of translation
Quasi-realtime languages
The theory of languages
Chains of full AFL's
Characterizations of transductions defined by abstract families of transducers
Abstract families of relations
On computational complexity of set automata
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines
Pebble minimization: the last theorems
Synthesizing Computable Functions from Rational Specifications Over Infinite Words
Transducers of polynomial growth
Gurevich-Harrington's games defined by finite automata
Regular combings, nonpositive curvature and the quasiconvexity of Abelian subgroups
Characterizations and computational complexity of systolic trellis automata
A note on off-line machines with 'Brownian' input heads

This page was built for publication: An Approach to a Unified Theory of Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536637)