Tight bounds on the complexity of cascaded decomposition of automata

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 rele...

Full description

Saved in:
Bibliographic Details
Published inFoundations of Computer Science, 31st Symposium pp. 672 - 682 vol.2
Main Authors Maler, O., Pnueli, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Automata
Counting circuits
Logic
Mathematics
Upper bound
Online AccessGet full text
ISBN081862082X
9780818620829
DOI10.1109/FSCS.1990.89589

Cover

More Information
Summary: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.< >
ISBN:081862082X
9780818620829
DOI:10.1109/FSCS.1990.89589