✦ LIBER ✦

Finite-turn checking automata

✍ Scribed by Rani Siromoney

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 443 KB
Volume: 5
Category: Article
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(71)80015-6

No coin nor oath required. For personal study only.

✦ Synopsis

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 family are established.

📜 SIMILAR VOLUMES

Checking Finite Traces using Alternating

Checking Finite Traces using Alternating Automata

✍ Bernd Finkbeiner; Henny Sipma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Checking automata and one-way stack lang

Checking automata and one-way stack languages

✍ Sheila Greibach 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 837 KB

A checking automaton is equivalent to a one-way nonerasing stack automaton which, once it enters its stack, never again writes on its stack. The checking automaton languages (cal) form a full AFL closed under substitution. If L C a\* is an infinite cal, then L contains an infinite regular set. Conse

Checking for tool collisions in turning

✍ S.J. Chen; S. Hinduja 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 551 KB

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

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