Image reducing words and subgroups of free groups.
type: Item
instance of: scholarly article
title: Image reducing words and subgroups of free groups.
zbMATH Open document ID: 1057.20025
DOI: 10.1016/S0304-3975(03)00093-8
author: D. S. Ananichev
author: A. Cherubini
author: M. V. Volkov
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 20E05
Mathematics Subject Classification ID: 20E07
Mathematics Subject Classification ID: 20F05
zbMATH DE Number: 2056472
zbMATH Keywords: synchronizing automata
zbMATH Keywords: compressible automata
zbMATH Keywords: 2-collapsing words
zbMATH Keywords: free groups
zbMATH Keywords: \(n\)-collapsing words
zbMATH Keywords: finite states
zbMATH Keywords: finite input alphabets
zbMATH Keywords: algorithms
zbMATH Keywords: finitely generated subgroups
zbMATH Keywords: subgroups of finite index
zbMATH Keywords: 2-synchronizing words
MaRDI profile type: Publication
cites work: Q4737904
cites work: Q5509690
cites work: A topology for free groups and related groups
cites work: Stallings foldings and subgroups of free groups
cites work: A counter example to a conjecture concerning synchronizing words in finite automata
cites work: Q4145882
cites work: FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
cites work: WORDS GUARANTEEING MINIMUM IMAGE
cites work: Q4174248
cites work: Q3981354
cites work: Topology of finite graphs
cites work: Q5573390
description: scientific article; zbMATH DE number 2056472