What You Must Remember When Processing Data Words

Michael Benedikt (1) , Clemens Ley (1) , Gabriele Puppis (2)

1 OUCL - Computing Laboratory
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic nite-memory automata (DMA). As a byproduct of this characterization result, we obtain a canonical representation for any DMA-recognizable language. We then show that this canonical automaton is minimal in a strong sense: it has the minimal number of control states and also the minimal amount of internal storage.

Domaines: Théorie et langage formel [cs.FL]

Michael Benedikt, Clemens Ley, Gabriele Puppis. What You Must Remember When Processing Data Words. Proceedings of AMW 2010, 2010, Buenos Aires, Argentina. http://ceur-ws.org/Vol-619/paper11.pdf. ⟨hal-00717773⟩