Formal languages
Handbook of formal languages, vol. 1
A construction on finite automata that has remained hidden
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Handbook of Formal Languages
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Finite automata and their decision problems
IBM Journal of Research and Development
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Supervisory control synthesis of discrete-event systems using a coordination scheme
Automatica (Journal of IFAC)
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science
| Hi-index | 0.00 |
A deterministic automaton accepting a regular language L is a state-partition automaton with respect to a projection P if the state set of the deterministic automaton accepting the projected language P(L), obtained by the standard subset construction, forms a partition of the state set of the automaton. In this paper, we study fundamental properties of state-partition automata. We provide a construction of the minimal state-partition automaton for a regular language and a projection, discuss closure properties of state-partition automata under the standard constructions of deterministic automata for regular operations, and show that almost all of them fail to preserve the property of being a state-partition automaton. Finally, we define the notion of a state-partition complexity, and prove the tight bound on the state-partition complexity of regular languages represented by incomplete deterministic automata.