Conjugacy and Equivalence of Weighted Automata and Functional Transducers

Marie-Pierre Béal 1 Sylvain Lombardy 2 Jacques Sakarovitch 3
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
3 LTCI - Laboratoire Traitement et Communication de l'Information
Abstract : We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) ¯eld and that the same holds true for functional tranducers as well.
Document type :
Conference papers
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download
https://hal-upec-upem.archives-ouvertes.fr/hal-00619855
Contributor : Sylvain Lombardy <>
Submitted on : Thursday, October 6, 2011 - 1:33:56 PM
Last modification on : Thursday, October 17, 2019 - 12:36:06 PM
Long-term archiving on: Saturday, January 7, 2012 - 2:21:29 AM

File

hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00619855, version 1

Collections

CNRS | INSTITUT-TELECOM | UNIV-PARIS7 | LIGM | LIGM_ALGO | UNIV-MLV | PARISTECH | ENPC | UPEC-UPEM | USPC | LTCI

Citation

Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch. Conjugacy and Equivalence of Weighted Automata and Functional Transducers. 1st International Computer Science Symposium in Russia (CSR 2006), Jun 2006, St. Petersburg, Russia. pp.58-69. ⟨hal-00619855⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

470

Files downloads

287

Contact

CCSD