𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finite automata and Burnside's problem for periodic groups

✍ Scribed by S. V. Aleshin

Publisher
SP MAIK Nauka/Interperiodica
Year
1972
Tongue
English
Weight
362 KB
Volume
11
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

The finite graph problem for two-way alt
The finite graph problem for two-way alternating automata
✍ MikoΕ‚aj BojaΕ„czyk πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 206 KB

Two-way alternating automata on inΓΏnite trees were introduced by Vardi (Reasoning about the part with two way