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 (43)
On coordinated selective substitutions: Towards a unified theory of grammars and machines ⋮ Pushdown machines for the macro tree transducer ⋮ From finite automata toward hybrid systems (Extended abstract) ⋮ High level tree transducers and iterated pushdown tree transducers ⋮ Algorithmic properties of structures ⋮ Stackautomaten in Labyrinthen ⋮ On transformations of programs ⋮ Computation over algebraic structures and a classification of undecidable problems ⋮ Weighted iterated linear control ⋮ Automata over continuous time ⋮ Iterated linear control and iterated one-turn pushdowns ⋮ Jede mit Stackautomaten berechenbare Funktion ist elementar ⋮ Division in idealized unit cost RAMs ⋮ Unnamed Item ⋮ Matrix Code ⋮ Unnamed Item ⋮ A survey of state vectors ⋮ Ein Modell des P=NP-Problems mit einer positiven Lösung ⋮ On the Complexity of Infinite Advice Strings ⋮ Iterated stack automata and complexity classes ⋮ Computability by Probabilistic Turing Machines ⋮ Storage products and linear control of derivations ⋮ Abstract families of relations ⋮ A Programming Language for the Interval Geometric Machine ⋮ \(X\)-automata on \(\omega\)-words ⋮ Abstract state machines: a unifying view of models of computation and of system design frameworks ⋮ Fuzzy and probabilistic programs ⋮ Max-product grammars and languages ⋮ Look-ahead on pushdowns ⋮ Unnamed Item ⋮ Dispositions, realism, and explanation ⋮ Weighted automata with storage ⋮ From Logic to Theoretical Computer Science – An Update ⋮ Linear weighted tree automata with storage and inverse linear tree homomorphisms ⋮ An Automata Characterisation for Multiple Context-Free Languages ⋮ Weighted Symbolic Automata with Data Storage ⋮ Register Transducers Are Marble Transducers ⋮ Principal abstract families of weighted tree languages ⋮ Subrecursive programming languages. II. On program size ⋮ Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.) ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Insertion languages ⋮ Extended macro grammars and stack controlled machines
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
This page was built for publication: Some definitional suggestions for automata theory
