. "12"^^ . "Minimalization of NFA using the universal automaton"@en . . "RIV/00216224:14310/04:00021223" . "Je dob\u0159e zn\u00E1mo, \u017Ee ka\u017Ed\u00FD minim\u00E1ln\u00ED NFA pro regul\u00E1rn\u00ED jazyk L je izomorfn\u00ED podautomatu tzv. univerz\u00E1ln\u00EDho automatu U pro L. Zkoum\u00E1me a porovn\u00E1v\u00E1me rozli\u010Dn\u00E9 podm\u00EDnky na mno\u017Einy stav\u016F automatu U, kter\u00E9 jsou p\u0159\u00EDbuzn\u00E9 faktu, \u017Ee indukovan\u00FD automat v U p\u0159ij\u00EDm\u00E1 cel\u00FD jazyk L. Metody n\u011Bkolika p\u0159edchoz\u00EDch prac\u00ED o minimalizaci NFA mohou b\u00FDt modifikov\u00E1ny tak, aby zapadly do na\u0161eho p\u0159\u00EDstupu. Rovn\u011B\u017E navrhujeme snadno implementovateln\u00FD algoritmus."@cs . "Minimalization of NFA using the universal automaton" . "Minimalizace NFA u\u017Eit\u00EDm univerz\u00E1ln\u00EDho automatu"@cs . . . "1"^^ . "Descriptional Complexity of Formal Systems" . "1"^^ . "Minimalization of NFA using the universal automaton"@en . . "As well-known, each minimal NFA for a regular language L is isomorphic to a subautomaton of the so-called universal automaton U for L . We explore and compare various conditions on sets of states of U which are related to the fact that induced subautomata of U accept the whole language L . The methods of several previous works on minimalizations of NFA can be transparently seen in our approach. We also propose a new algorithm which is easy to implement." . "London, Canada" . "[9C467E9DA283]" . "RIV/00216224:14310/04:00021223!RIV09-MSM-14310___" . "Minimalizace NFA u\u017Eit\u00EDm univerz\u00E1ln\u00EDho automatu"@cs . "London, Canada" . "0-7714-2506-6" . . . "Pol\u00E1k, Libor" . "Minimalization of NFA using the universal automaton" . "As well-known, each minimal NFA for a regular language L is isomorphic to a subautomaton of the so-called universal automaton U for L . We explore and compare various conditions on sets of states of U which are related to the fact that induced subautomata of U accept the whole language L . The methods of several previous works on minimalizations of NFA can be transparently seen in our approach. We also propose a new algorithm which is easy to implement."@en . "Z(MSM 143100009)" . "14310" . "573721" . . "The University of Western Ontario" . . . . . . . "minimalization of NFA; universal automaton"@en . "2004-01-01+01:00"^^ . .