𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connection between context-free groups and groups with decidable problems of automata equivalence

✍ Scribed by L. B. Smikun


Publisher
Springer US
Year
1977
Tongue
English
Weight
482 KB
Volume
12
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


PSPACE-complete problems for subgroups o
✍ 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