✦ LIBER ✦

Finite counting automata

✍ Scribed by M.P. Schützenberger

Book ID: 114036386
Publisher: Elsevier Science
Year: 1962
Weight: 769 KB
Volume: 5
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(62)90244-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Entropy and expected acceptance counts f

Entropy and expected acceptance counts for finite automata

✍ Pippenger, N. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 257 KB

Separating Exponentially Ambiguous Finit

Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata

✍ Leung, Hing 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 267 KB

Finite abstract random automata

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

Robust RBF finite automata

✍ Michal Šorel; Jiřı́ Šı́ma 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Enumeration of finite automata

✍ Frank Harary; Ed Palmer 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 432 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