| Publication type: |
 |
Conference proceedings |
|
| Subject: |
|
Computer Science/Discrete Mathematics
|
|
| Title: |
|
On the equivalence of Z-automata |
|
| Author(s): |
|
Marie-Pierre Béal ( ) 1, Sylvain Lombardy () 2, Jacques Sakarovitch () 3 |
|
| Laboratory: |
|
|
|
| Abstract: |
|
We prove that two automata with multiplicity in Z are equivalent, i.e. define the same rational series, if and only if there is a sequence of Z-coverings, co-Z-coverings, and circulations of –1, which transforms one automaton into the other. Moreover, the construction of these transformations is effective. This is obtained by combining two results: the first one relates coverings to conjugacy of automata, and is modeled after a theorem from symbolic dynamics; the second one is an adaptation of Schützenberger's reduction algorithm of representations in a field to representations in an Euclidean domain (and thus in Z). |
|
| Fulltext language: |
|
English |
|
|
| Book title: |
|
Automata Languages and Programming. 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 2005. Proceedings. |
|
| Publication date: |
|
2005 |
|
| Page, identifiant, ...: |
|
397-409 |
|
| Commercial editor: |
|
Springer-Verlag |
|
| Scientifics editor: |
|
L Caires, G Italiano, L Monteiro, C Palamidessi, M Yung |
|
| Serie: |
|
LNCS 3580 |
|
|
| Conference date: |
|
2005 |
|
|
| Keyword(s): |
|
Automata with multiplicities – coverings of automata – conjugacy |
|
|
Export this paper
