Canonicity in GFG and Transition-Based Automata

Bader Abu Radi
Bader Abu Radi
Cited by: 0|Bibtex|Views0|Links

Abstract:

Minimization of deterministic automata on finite words results in a {\em canonical\/} automaton. For deterministic automata on infinite words, no canonical minimal automaton exists, and a language may have different minimal deterministic B\"uchi (DBW) or co-B\"uchi (DCW) automata. In recent years, researchers have studied {\em good-for-...More

Code:

Data:

Your rating :
0

 

Tags
Comments