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