✦ LIBER ✦

Decision Problems of Finite Automata Design and Related Arithmeticsby C. C. Elgot

✍ Scribed by Review by: Robert McNaughton

Book ID: 124959282
Publisher: Association for Symbolic Logic
Year: 1969
Tongue: English
Weight: 359 KB
Volume: 34
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2270940

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decision Problems of Finite Automata Des

Decision Problems of Finite Automata Design and Related Arithmetics

✍ Calvin C. Elgot 📂 Article 📅 1961 🏛 American Mathematical Society 🌐 English ⚖ 949 KB

The Decision Problems of Definite Stocha

The Decision Problems of Definite Stochastic Automata

✍ Chen, I-Ngo; Sheng, C. L. 📂 Article 📅 1970 🏛 Society for Industrial and Applied Mathematics ⚖ 714 KB

Recherche d'une Algèbre Logique Continue

Recherche d'une Algèbre Logique Continue.by Nicolas Rouche;Cybernetic Models and Thought Processesby Wolfe Mays;Logique et Cybernétique.by Henryk Greniewski;Finite Automata and their Decision Problemsby M. O. Rabin; D. Scott;The Reduction of Two-way Automata to One-way Automataby J. C. Shepherdson

✍ Review by: Calvin C. Elgot 📂 Article 📅 1960 🏛 Association for Symbolic Logic 🌐 English ⚖ 155 KB

PSPACE-complete problems for subgroups o

PSPACE-complete problems for subgroups of free groups and inverse finite automata

✍ J.-C. Birget; S. Margolis; J. Meakin; P. Weil 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 384 KB

We investigate the complexity of algorithmic problems on ÿnitely generated subgroups of free groups. Margolis and Meakin showed how a ÿnite monoid Synt(H ) can be canonically and e ectively associated with such a subgroup H . We show that H is pure (that is, closed under radical) if and only if Synt