Abstract
lternating finite automata are a generalization of non-deterministic finite automata and a mechanism that models parallel computation. It has been shown in [6] that alternating finite automata (AFA) have several theoretical properties and practical features. In this paper, we further study alternating finite automata. A new type of system of equations is introduced. The systems of equations to be considered involve Boolean expressions over a finite set X and the symbols of an alphabet A. Each AFA can be described as a system of equations that has a unique fixpoint, and whose solutions are precisely the regular languages. We present an algebraic interpretation of AFA, which parallels that of regular expressions and of linear equations. We also explore direct ways of solving such systems and generating equivalent AFA from regular expressions or even extended regular expressions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
