Other formats:
BibTeX
LaTeX
RIS
@article{991107,
author = {Klíma, Ondřej and Polák, Libor},
article_location = {Francie},
article_number = {4},
doi = {http://dx.doi.org/10.1051/ita/2012014},
keywords = {Biautomata; piecewise testable languages},
language = {eng},
issn = {0988-3754},
journal = {RAIRO - Theoretical Informatics and Applications},
title = {On Biautomata},
volume = {46},
year = {2012}
}
TY - JOUR
ID - 991107
AU - Klíma, Ondřej - Polák, Libor
PY - 2012
TI - On Biautomata
JF - RAIRO - Theoretical Informatics and Applications
VL - 46
IS - 4
SP - 573-592
EP - 573-592
SN - 09883754
KW - Biautomata
KW - piecewise testable languages
N2 - 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.
ER -
KLÍMA, Ondřej and Libor POLÁK. On Biautomata. \textit{RAIRO - Theoretical Informatics and Applications}. Francie, vol.~46, No~4, p.~573-592. ISSN~0988-3754. doi:10.1051/ita/2012014. 2012.
|
