Multitape one-way nonwriting automata
From MaRDI portal
Publication:2527943
DOI10.1016/S0022-0000(68)80028-5zbMath0159.01504MaRDI QIDQ2527943
Arnold L. Rosenberg, Patrick C. Fischer
Publication date: 1968
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
An Automata Theoretic Approach to Rational Tree Relations, Abstract families of relations, Synchronized rational relations of finite and infinite words, Limitedness theorem on finite automata with distance functions: An algebraic proof, On the power of synchronization in parallel computations, New techniques for proving the decidability of equivalence problem, Small overlap monoids. II: Automatic structures and normal forms., Rational equivalence relations, The equivalence of finite valued transducers (on HDT0L languages) is decidable, Hierarchies of one-way multihead automata languages, Multihead one-way finite automata, On the decidability of the equivalence problem for partially commutative rational power series, Marker automata, Finite automata with multiplication, Modelization of deterministic rational relations, On the representation of finite deterministic 2-tape automata, Sequential?, Finite-turn checking automata, Decision problems among the main subfamilies of rational relations, On the Decidability of the Equivalence for k-Valued Transducers, On the Decidability of the Equivalence for a Certain Class of Transducers, Restricted one-counter machines with undecidable universe problems, Unnamed Item
Cites Work
