RAIRO-Theor. Inf. Appl.
Volume 46, Number 4, October-December 2012Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)
|Page(s)||573 - 592|
|Published online||19 June 2012|
Department of Mathematics and Statistics, Masaryk University, Kotlrářská 2, 61137 Brno, Czech Republic
Received: 11 November 2011
Accepted: 3 May 2012
We initiate the theory and applications of biautomata. A biautomaton can read a word alternately from the left and from the right. We assign to each regular language L its canonical biautomaton. This structure plays, among all biautomata recognizing the language L, the same role as the minimal deterministic automaton has among all deterministic automata recognizing the language L. We expect that from the graph structure of this automaton one could decide the membership of a given language for certain significant classes of languages. We present the first two results of this kind: namely, a language L is piecewise testable if and only if the canonical biautomaton of L is acyclic. From this result Simon’s famous characterization of piecewise testable languages easily follows. The second class of languages characterizable by the graph structure of their biautomata are prefix-suffix testable languages.
Mathematics Subject Classification: 68Q70
Key words: Biautomata / canonical biautomaton / piecewise testable languages / prefix-suffix languages
© EDP Sciences 2012
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.