Image reducing words and subgroups of free groups.

DOI10.1016/S0304-3975(03)00093-8zbMath1057.20025MaRDI QIDQ1426037

D. S. Ananichev, Mikhail V. Volkov, A. Cherubini Spoletini

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

algorithmssubgroups of finite indexfinitely generated subgroupsfree groupssynchronizing automatafinite states\(n\)-collapsing words2-collapsing words2-synchronizing wordscompressible automatafinite input alphabets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Algebraic theory of languages and automata (68Q70) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (7)

Recognizing 3-collapsing words over a binary alphabet ⋮ 2-Synchronizing Words ⋮ An algorithm for recognition of \(n\)-collapsing words ⋮ WORDS GUARANTEEING MINIMUM IMAGE ⋮ Collapsing words, permutation conditions and coherent colorings of trees ⋮ COLLAPSING WORDS: A PROGRESS REPORT ⋮ ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS

Cites Work

• Topology of finite graphs
• Stallings foldings and subgroups of free groups
• WORDS GUARANTEEING MINIMUM IMAGE
• FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
• A topology for free groups and related groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Image reducing words and subgroups of free groups.