An Approach to a Unified Theory of Automata

Cited In (45)

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

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)