Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: basic automaton

Sortuj według:

Ogranicz wyniki do:

Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems

Melnikov B.

Fundamenta Informaticae

2010

Vol. 104, nr 3

267-283

We consider in this paper the problem of edge-minimization for nondeterministic finite automata and some connected questions. We shall formulate a new algorithm solving this problem; this algorithm is a simplification of two ones published before. The connected problems include at first algorithms of combining states. We formulate some new sufficient conditions for the possibility of such combining.

Extended Nondeterministic Finite Automata

Melnikov B.

Fundamenta Informaticae

2010

Vol. 104, nr 3

255-265

We consider a new expansion of nondeterministic finite automata. The goals of this consideration are: to apply some algorithms of such expansion for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; using such automata, we often can simplify some proofs for algorithms of simplification of usual nondeterministic automata.