Automata theory: Its past and future
From MaRDI portal
Recommendations
Cited in
(19)- Automata and complexity. Essays presented to Eric Goles on the occasion of his 70th birthday
- A half-century of automata theory. Celebration and inspiration. Symposium, Univ. of Western Ontario, London, Ontario, Canada, July 26, 2000
- State complexity of two combined operations: catenation-star and catenation-reversal
- Formal descriptions of code properties: decidability, complexity, implementation
- A class of simple \(C^{*}\)-algebras arising from certain non-sofic subshifts
- Orthogonal shuffle on trajectories
- THE DEVELOPMENT OF FORMAL LANGUAGE THEORY SINCE 1956
- THE FINITE TILING PROBLEM IS UNDECIDABLE IN THE HYPERBOLIC PLANE
- On the operating unit size of load/store architectures
- Nonlinear phenomena in spaces of algorithms
- scientific article; zbMATH DE number 1512078 (Why is no real title available?)
- Signed real measure of regular languages for discrete-event automata
- One-time nondeterministic computations
- Nature computes: information processing in quantum dynamical systems
- A geometric approach to complexity
- STAR-FREE GEODESIC LANGUAGES FOR GROUPS
- Maurer computers for pipelined instruction processing
- CONFLICTS AND FAIR TESTING
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
This page was built for publication: Automata theory: Its past and future
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776607)
