On properties and state complexity of deterministic state-partition automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F12%3A00381247" target="_blank" >RIV/67985840:_____/12:00381247 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-33475-7_12" target="_blank" >http://dx.doi.org/10.1007/978-3-642-33475-7_12</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-33475-7_12" target="_blank" >10.1007/978-3-642-33475-7_12</a>

Result language
angličtina
Original language name
On properties and state complexity of deterministic state-partition automata
Original language description
A deterministic automaton accepting a regular language L is a state-partition automaton with respect to a projection P if the state set of the deterministic automaton accepting the projected language P(L), obtained by the standard subset construction, forms a partition of the state set of the automaton. In this paper, we study fundamental properties of state-partition automata. We provide a construction of the minimal state-partition automaton for a regular language and a projection, discuss closure properties of state-partition automata under the standard constructions of deterministic automata for regular operations, and show that almost all of them fail to preserve the property of being a state-partition automaton. Finally, we define the notion of astate-partition complexity, and prove the tight bound on the state-partition complexity of regular languages represented by incomplete deterministic automata.
Czech name
—
Czech description
—

Project
<a href="/en/project/GPP202%2F11%2FP028" target="_blank" >GPP202/11/P028: Decentralized and coordination supervisory control</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)