Some definitional suggestions for automata theory
From MaRDI portal
Publication:2529464
DOI10.1016/S0022-0000(67)80014-XzbMath0164.32103MaRDI QIDQ2529464
Publication date: 1967
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
From Logic to Theoretical Computer Science – An Update, Algorithmic properties of structures, Stackautomaten in Labyrinthen, Jede mit Stackautomaten berechenbare Funktion ist elementar, Computability by Probabilistic Turing Machines, Abstract families of relations, Look-ahead on pushdowns, Insertion languages, Extended macro grammars and stack controlled machines, On coordinated selective substitutions: Towards a unified theory of grammars and machines, Pushdown machines for the macro tree transducer, High level tree transducers and iterated pushdown tree transducers, Division in idealized unit cost RAMs, Ein Modell des P=NP-Problems mit einer positiven Lösung, Iterated stack automata and complexity classes, \(X\)-automata on \(\omega\)-words, Fuzzy and probabilistic programs, Max-product grammars and languages, Dispositions, realism, and explanation, On transformations of programs, Automata over continuous time, Abstract state machines: a unifying view of models of computation and of system design frameworks, Storage products and linear control of derivations, Subrecursive programming languages. II. On program size, Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.), Iterated linear control and iterated one-turn pushdowns
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequences in context free languages
- How to Program an Infinite Abacus
- Monogenic normal systems are universal
- Turing machines with restricted memory access
- Stack automata and compiling
- Computability of Recursive Functions
- On Ianov's Program Schemata
- A variant of a recursively unsolvable problem
