Abstract
We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finitestate automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation.
| Original language | English |
|---|---|
| Title of host publication | Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings |
| Pages | 398-409 |
| Number of pages | 12 |
| DOIs | |
| Publication status | Published - 2009 Jul 13 |
| Event | 3rd International Conference on Language and Automata Theory and Applications, LATA 2009 - Tarragona, Spain Duration: 2009 Apr 2 → 2009 Apr 8 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 5457 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 3rd International Conference on Language and Automata Theory and Applications, LATA 2009 |
|---|---|
| Country | Spain |
| City | Tarragona |
| Period | 09/4/2 → 09/4/8 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Han, Y. S., Salomaa, K., & Yu, S. (2009). State complexity of combined operations for prefix-free regular languages. In Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings (pp. 398-409). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5457). https://doi.org/10.1007/978-3-642-00982-2_34