Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory

Abstract

The hierarchical algebraic decomposition of finite state automata (Krohn-Rhodes Theory) has been a mathematical theory without any computational implementations until the present paper, although several possible and promising practical applications, such as automated object-oriented programming in software development [5], formal methods for understanding… (More)
DOI: 10.1007/978-3-540-30500-2_32

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.