Pages that link to "Item:Q5536637"

The following pages link to An Approach to a Unified Theory of Automata (Q5536637):

Displaying 45 items.

• The derivational complexity of string rewriting systems (Q441853) (← links)
• Gurevich-Harrington's games defined by finite automata (Q685082) (← links)
• Regular combings, nonpositive curvature and the quasiconvexity of Abelian subgroups (Q686014) (← links)
• Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
• A note on off-line machines with 'Brownian' input heads (Q801900) (← links)
• Extended macro grammars and stack controlled machines (Q1064075) (← links)
• On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) (← links)
• On locating minimum feedback vertex sets (Q1113681) (← links)
• On generalized zeta functions of formal languages and series (Q1179183) (← links)
• A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
• Iterated stack automata and complexity classes (Q1183602) (← links)
• \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
• Automatic correction of syntax-errors in programming languages (Q1211841) (← links)
• Abstract families of length-preserving processors (Q1222025) (← links)
• Periodicities on trees (Q1275075) (← links)
• Equational derivation vs. computation (Q1338198) (← links)
• Query automata over finite trees (Q1607226) (← links)
• The power of two-way deterministic checking stack automata (Q1812540) (← links)
• Linear weighted tree automata with storage and inverse linear tree homomorphisms (Q2051842) (← links)
• Automata equipped with auxiliary data structures and regular realizability problems (Q2096592) (← links)
• A generalized mathematical theory of structured programming (Q2265794) (← links)
• Deterministic stack automata and the quotient operator (Q2531282) (← links)
• What makes some language theory problems undecidable (Q2540268) (← links)
• Writing pushdown acceptors (Q2540271) (← links)
• Time- and tape-bounded Turing acceptors and AFLs (Q2542726) (← links)
• Abstract families of processors (Q2546020) (← links)
• A characterization of two-way deterministic classes of languages (Q2547802) (← links)
• Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata (Q2558752) (← links)
• The many faces of a translation (Q2581761) (← links)
• One-way acceptors and languages (Q4057630) (← links)
• AUTOMATA AND DIGITAL COMPUTERS (Q4105255) (← links)
• On restarting automata with auxiliary symbols and small window size (Q5021113) (← links)
• (Q5061521) (← links)
• The theory of languages (Q5551468) (← links)
• A general theory of translation (Q5563368) (← links)
• Quasi-realtime languages (Q5582342) (← links)
• The theory of languages (Q5592247) (← links)
• Chains of full AFL's (Q5603191) (← links)
• Characterizations of transductions defined by abstract families of transducers (Q5626546) (← links)
• Abstract families of relations (Q5904504) (← links)
• On computational complexity of set automata (Q5918383) (← links)
• New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines (Q6040662) (← links)
• Pebble minimization: the last theorems (Q6091210) (← links)
• Synthesizing Computable Functions from Rational Specifications Over Infinite Words (Q6195088) (← links)
• Transducers of polynomial growth (Q6649429) (← links)