Title :
Tight bounds on the complexity of cascaded decomposition of automata
Author :
Maler, Oded ; Pnuel, Amir
Author_Institution :
INRIA-IRISA, Rennes, France
Abstract :
Exponential upper and lower bounds on the size of the cascaded (Krohn-Rhodes) decomposition of automata are given. These results are used to obtain elementary algorithms for various translations between automata and temporal logic, where the previously known translations were nonelementary. The relevance of the result is discussed
Keywords :
automata theory; computational complexity; temporal logic; Krohn-Rhodes decomposition; automata; cascaded decomposition; complexity; temporal logic; Automata; Books; Counting circuits; Logic; Mathematics; Upper bound;
Conference_Titel :
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location :
St. Louis, MO
Print_ISBN :
0-8186-2082-X
DOI :
10.1109/FSCS.1990.89589
