𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finite abstract random automata

✍ Scribed by Octav Onicescu; Silviu GuiaŞu

Publisher
Springer
Year
1965
Tongue
English
Weight
337 KB
Volume
3
Category
Article
ISSN
1432-2064

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random environments and automata
Random environments and automata
✍ Akihiro Takeuchi; Tadahiro Kitahashi; Kokichi Tanaka 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 542 KB
Finite-turn checking automata
Finite-turn checking automata
✍ Rani Siromoney 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 443 KB

A one-to-one correspondence is established between the class of all equal matrix languages and the class of finite-turn checking automata. This checking automaton is provided with a counter in its memory to keep track of the number of turns of the stack-head. Several closure properties of this famil

Multiple-entry finite automata
Multiple-entry finite automata
✍ Arthur Gill; Lawrence T. Kou 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 686 KB

A multiple-entry finite automaton (mefa) is a finite automaton where any state can serve as an initial state. The reason for studying such automata is that there is a class of regular sets which can be recognized much more economically with a parallel bank of identical mefa's than with conventional