✦ LIBER ✦

Multiple-entry finite automata

✍ Scribed by Arthur Gill; Lawrence T. Kou

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 686 KB
Volume: 9
Category: Article
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(74)80034-6

No coin nor oath required. For personal study only.

✦ Synopsis

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 finite automata. In this paper we study properties of mefa's and formulate a necessary and sufficient condition for regular sets to be mefa-recognizable. We also develop algorithms for testing for this condition and for constructing the recognizing mefa whenever this condition is satisfied.

📜 SIMILAR VOLUMES

Some remarks on multiple-entry finite au

Some remarks on multiple-entry finite automata

✍ Paulo A.S. Veloso; Arthur Gill 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 133 KB

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

Finite abstract random automata

✍ Octav Onicescu; Silviu GuiaŞu 📂 Article 📅 1965 🏛 Springer 🌐 English ⚖ 337 KB

Representations of finite automata

✍ I. S. Grunskii 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 778 KB

Congruences of finite automata

✍ V. A. Plaksin 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 366 KB

Avoiding multiple entry arrays

✍ Chetwynd, Amanda G. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

In this paper we consider the problem of avoiding arrays with more than one entry per cell. An n × n array on n symbols is said to be avoidable if an n × n latin square, on the same symbols, can be found which differs from the array in every cell. Our first result is for chessboard squares with at m