On Biautomata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F12%3A00057567" target="_blank" >RIV/00216224:14310/12:00057567 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1051/ita/2012014" target="_blank" >http://dx.doi.org/10.1051/ita/2012014</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1051/ita/2012014" target="_blank" >10.1051/ita/2012014</a>
Alternative languages
Result language
angličtina
Original language name
On Biautomata
Original language description
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 thelanguage 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F1313" target="_blank" >GA201/09/1313: Algebraic Methods in Automata and Formal Language Theory II</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
RAIRO - Theoretical Informatics and Applications
ISSN
0988-3754
e-ISSN
—
Volume of the periodical
46
Issue of the periodical within the volume
4
Country of publishing house
FR - FRANCE
Number of pages
20
Pages from-to
573-592
UT code for WoS article
000310757900007
EID of the result in the Scopus database
—