Finite automata and unary languages
Theoretical Computer Science
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs
Theoretical Computer Science
Note on Minimal Finite Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
NFA to DFA Transformation for Finite Languages
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
A family of NFAs which need 2n - α deterministic states
Theoretical Computer Science
Magic numbers in the state hierarchy of finite automata
Information and Computation
On the State Complexity of Complements, Stars, and Reversals of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Determination of finite automata accepting subregular languages
Theoretical Computer Science
Compositional Verification in Supervisory Control
SIAM Journal on Control and Optimization
On the Computation of Natural Observers in Discrete-Event Systems
Discrete Event Dynamic Systems
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Supervisory control synthesis of discrete-event systems using a coordination scheme
Automatica (Journal of IFAC)
On the state and computational complexity of the reverse of acyclic minimal DFAs
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On properties and state complexity of deterministic state-partition automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 5.23 |
A transition is unobservable if it is labeled by a symbol removed by a projection. The present paper investigates a new structural property of incomplete deterministic finite automata-a number of states incident with an unobservable transition-and its effect on the state complexity of projected regular languages. We show that the known upper bound can be met only by automata with one unobservable transition (up to unobservable multi-transitions). We improve this upper bound by taking into consideration the structural property of minimal incomplete automata, and prove the tightness of new upper bounds. Special attention is focused on the case of finite languages. The paper also presents and discusses several fundamental problems which are still open.