On Hadamard Series and Rotating Q-Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

On Hadamard Series and Rotating Q-Automata

Résumé

In this paper, we study rotating Q-automata, which are (memoryless) automata with weights in Q, that can read the input tape from left to right several times. We show that the series realized by valid rotating Q-automata are Q-Hadamard series (which are the closure of Q-rational series by pointwise inverse), and that every Q-Hadamard series can be realized by such an automaton. We prove that, although validity of rotating Q-automata is undecidable, the equivalence problem is decidable on rotating Q-automata. Finally, we prove that every valid two-way Q-automaton admits an equivalent rotating Q-automaton. The conversion, which is effective, implies the decidability of equivalence of two-way Q-automata.
Fichier non déposé

Dates et versions

hal-01866198 , version 1 (03-09-2018)

Identifiants

Citer

Louis-Marie Dando, Sylvain Lombardy. On Hadamard Series and Rotating Q-Automata. Mathematical Foundations of Computer Science, MFCS 2018, Igor Potapov; Paul Spirakis; James Worrell, Aug 2018, Liverpool, United Kingdom. pp.6:1--6:14, ⟨10.4230/LIPIcs.MFCS.2018.6⟩. ⟨hal-01866198⟩

Collections

CNRS TDS-MACS
52 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More