✦ LIBER ✦

Loop-free compositions of certain finite automata

✍ Scribed by V.B. Johnsen; K. Kjeldsen

Book ID: 114036981
Publisher: Elsevier Science
Year: 1973
Weight: 703 KB
Volume: 22
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(73)90519-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the output structure of certain finit

On the output structure of certain finite automata

✍ V.B. Johnsen 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 520 KB

Time complexity of loop-free two-way pus

Time complexity of loop-free two-way pushdown automata

✍ Wojciech Rytter 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Loop-Free Gray Code Algorithms for the S

Loop-Free Gray Code Algorithms for the Set of Compositions

✍ Toufik Mansour; Ghalib Nassar 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 302 KB

The residual finiteness of certain amalg

The residual finiteness of certain amalgamated free products

✍ Marvin Tretkoff 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 French ⚖ 193 KB

Classification and enumeration of matche

Classification and enumeration of matched free response matrices of linear finite automata

✍ Dai Zongduo; Ye Dingfeng; Zhai Qibin; Ou Haiwen 📂 Article 📅 1997 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 468 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