Publication details
State Complexity of Projected Languages
| Authors | |
|---|---|
| Year of publication | 2011 |
| Type | Article in Proceedings |
| Conference | DCFS 2011, LNCS 6808 |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | Descriptional complexity, state complexity, projection. |
| Description | 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. |