Aperiodicity of rational functions is PSpace-complete - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Aperiodicity of rational functions is PSpace-complete

Abstract

It is known that a language of finite words is definable in monadic second-order logic – MSO – (resp. first-order logic – FO –) iff it is recognized by some finite automaton (resp. some aperiodic finite automaton). Deciding whether an automaton A is equivalent to an aperiodic one is known to be PSPACE-complete. This problem has an important application in logic: it allows one to decide whether a given MSO formula is equivalent to some FO formula. In this paper, we address the aperiodicity problem for functions from finite words to finite words (transductions), defined by finite transducers, or equivalently by bimachines, a transducer model studied by Schützenberger and Reutenauer. Precisely, we show that the problem of deciding whether a given bimachine is equivalent to some aperiodic one is PSPACE-complete.
Fichier principal
Vignette du fichier
aperiodicity-pspace.pdf (543.19 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01410188 , version 1 (06-12-2016)

Identifiers

  • HAL Id : hal-01410188 , version 1

Cite

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote. Aperiodicity of rational functions is PSpace-complete. 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), Dec 2016, Chennai, India. ⟨hal-01410188⟩

Collections

CNRS ANR
129 View
128 Download

Share

Gmail Facebook X LinkedIn More