Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
In this paper we continue to investigate the complexity of the circuit representation of DFA—BC-complexity. We compare it with nondeterministic state complexity, obtain upper and lower bounds which differ only by a factor of 4 for a Binary input alphabet. Also we prove that many simple operations (determining if a state is reachable or if an automaton is minimal) are PSPACE-complete for DFA given in circuit representation.
- 2.Calazans, N.L.: State minimization and state assignment of finite state machines: their relationship and their impact on the implementation. PhD thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1993)Google Scholar
- 6.Valdats, M.: Boolean circuit complexity of regular languages. In: International Conference on Automata and Formal Languages. EPTCS, vol. 151, pp. 342–354 (2014)Google Scholar
- 9.Lupanov, O.: Asymptotic estimates of the complexity of control systems. Moscow State University (1984). (in Russian)Google Scholar
- 13.Borchert, B., Lozano, A.: Succinct circuit representations and leaf languages are basically the same concept. Technical report, Universitat Politechnica de Catalunya (1996). http://upcommons.upc.edu/handle/2117/97245