Abstract
Boolean automata are a generalization of finite automata in the sense that the next state (the result of the transition function, given a state and a letter) is not just a single state (deterministic automata) or a set of states (nondeterministic automata) but a boolean function of the states. Boolean automata accept precisely the regular languages; also, they correspond in a natural way to certain language equation involving complementation as well as to sequential networks. In a previous note we showed that for every n ⩾ 1, there exists a boolean automaton B n with n states such that the smallest deterministic automaton for the same language has 2 2 n states. In the present note we will show a precisely attainable lower bound on the succinctness of representing regular languages by boolean automata; namely, we will show that, for every n ⩾ 1, there exists a reduced automaton D n with n states such that the smallest boolean automaton accepting the same language has also n states.
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.
