Handbook of formal languages, vol. 1
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs
Theoretical Computer Science
Introduction to the Theory of Computation
Introduction to the Theory of Computation
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
Errata to: "finite automata and unary languages"
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)
Magic Numbers and Ternary Alphabet
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
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
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science
State complexity of projection and quotient on unranked trees
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Model learning and test generation for event-b decomposition
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
| Hi-index | 0.00 |
This paper discusses the state complexity of projected regular languages represented by incomplete deterministic finite automata. It is shown that the known upper bound is reachable only by automata with one unobservable transition, that is, a transition labeled with a symbol removed by the projection. The present paper improves this upper bound by considering the structure of the automaton. It also proves that the new bounds are tight, considers the case of finite languages, and presents several open problems.