Skip to Main content Skip to Navigation
Journal articles

On the representation of finite 2-deterministic automata

Maryse Pelletier 1 Jacques Sakarovitch 
1 CALFOR - Calcul formel
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper presents properties of relations between words that are realized by deterministic finite 2-tape automata. It has been made as complete as possible, and is structured by the systematic use of the matrix representation of automata. It is first shown that deterministic 2-tape automata are characterized as those which can be given a prefix matrix representation. Schützenberger construct on representations, the one that gives semi-monomial representations for rational functions of words, is then applied to this prefix representation in order to obtain a new proof of the fact that the lexicographic selection of a deterministic rational relation on words is a rational function.
Document type :
Journal articles
Complete list of metadata
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Tuesday, May 5, 2015 - 2:31:14 PM
Last modification on : Wednesday, April 6, 2022 - 3:32:41 AM

Links full text



Maryse Pelletier, Jacques Sakarovitch. On the representation of finite 2-deterministic automata. Theoretical Computer Science, Elsevier, 1999, 225 (1-2), pp.1-63. ⟨10.1016/S0304-3975(98)00179-0⟩. ⟨hal-01148825⟩



Record views