On the Krohn-Rhodes Cascaded Decomposition Theorem

DOI10.1007/978-3-642-13754-9_12zbMath1288.68177OpenAlexW1868369947MaRDI QIDQ3587258

Oded Maler

Publication date: 7 September 2010

Published in: Time for Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13754-9_12

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (7)

The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) ⋮ The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case ⋮ A simple rewrite system for the normalization of linear temporal logic ⋮ On the translation of automata to linear temporal logic ⋮ Effective theories for circuits and automata ⋮ Back to the future: a fresh look at linear temporal logic ⋮ The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)

Cites Work

• On finite monoids having only trivial subgroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines
• Yet another proof of the cascade decomposition theorem for finite automata
• A Note on Star-Free Events
• Is Switching Theory Mathematics or Engineering?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Krohn-Rhodes Cascaded Decomposition Theorem