Alternative Automata Characterization of Piecewise Testable Languages

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F13%3A00066861" target="_blank" >RIV/00216224:14310/13:00066861 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-38771-5_26" target="_blank" >http://dx.doi.org/10.1007/978-3-642-38771-5_26</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-38771-5_26" target="_blank" >10.1007/978-3-642-38771-5_26</a>

Result language
angličtina
Original language name
Alternative Automata Characterization of Piecewise Testable Languages
Original language description
We present a transparent condition on a minimal automaton which is equivalent to piecewise testability of the corresponding regular language. The condition simplifies the original Simon?s condition on the minimal automaton in a different way than conditions of Stern and Trahtman. Secondly, we prove that every piecewise testable language L is k-piecewise testable for k equal to the depth of the minimal DFA of L. This result improves all previously known estimates of such k.
Czech name
—
Czech description
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)