On boolean combinations forming piecewise testable languages

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F17%3A00475229" target="_blank" >RIV/67985840:_____/17:00475229 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.tcs.2017.01.017" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2017.01.017</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2017.01.017" target="_blank" >10.1016/j.tcs.2017.01.017</a>

Result language
angličtina
Original language name
On boolean combinations forming piecewise testable languages
Original language description
A regular language is k-piecewise testable (k-PT) if it is a Boolean combination of languages of the form La_1a_2...a_n}=..., where a_i ... and ... Given a finite automaton A, if the language L(A) is piecewise testable, we want to express it as a Boolean combination of languages of the above form. The idea is as follows. If the language is k-PT, then there exists a congruence k of finite index such that L(A) is a finite union of k-classes. Every such class is characterized by an intersection of languages of the from L_u, for ..., and their complements. To represent the k-classes, we make use of the k-canonical DFA. We identify the states of the k-canonical DFA whose union forms the language L(A) and use them to construct the required Boolean combination. We study the computational and descriptional complexity of related problems.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)