RAIRO-Theor. Inf. Appl.
Volume 38, Number 1, January-March 2004
|Page(s)||49 - 67|
|Published online||15 March 2004|
Free group languages: Rational versus recognizable
Centro de Matemática, Faculdade de Ciências,
Universidade do Porto, R. do Campo Alegre, 687, 4169-007 Porto, Portugal;
Accepted: 11 December 2003
We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups). Several different algorithmic characterizations of recognizability are obtained, as well as other decidability results.
Mathematics Subject Classification: 20E05 / 20F10 / 68Q45
Key words: Free group / rational subsets / recognizable subsets.
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.