Finiteness Conditions on Subgroups and Formal Language Theory

DOI10.1112/plms/s3-58.1.74zbMath0674.20018OpenAlexW2040556423MaRDI QIDQ3828188

Paul E. Schupp, Jacques Sakarovitch, Christiane Frougny

Publication date: 1989

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-58.1.74

zbMATH Keywords

finiteness conditionsformal language theorysubgroup of a finitely generated group

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (11)

Cancellation in context-free languages: enrichment by reduction ⋮ On a subclass of context-free groups ⋮ \(\mathcal{L}\)-reduction computation revisited ⋮ On the rational subset problem for groups. ⋮ Green index in semigroups: generators, presentations, and automatic structures. ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Context-free pairs of groups. I: Context-free pairs and graphs ⋮ The generalized conjugacy problem for virtually free groups ⋮ On the computing powers of \(\mathcal{L}\)-reductions of insertion languages ⋮ Group presentations, formal languages and characterizations of one- counter groups ⋮ Inverse subsemigroups of finite index in finitely generated inverse semigroups

This page was built for publication: Finiteness Conditions on Subgroups and Formal Language Theory