Abstract
We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. First we compute upper bounds using structural properties of minimal deterministic finite-state automata for finite languages. Then, we show that the upper bounds are tight if we have a variable sized alphabet that can depend on the size of input deterministic finite-state automata. In addition, we prove that the upper bounds are unreachable for any fixed sized alphabet.
| Original language | English |
|---|---|
| Pages (from-to) | 581-595 |
| Number of pages | 15 |
| Journal | International Journal of Foundations of Computer Science |
| Volume | 19 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2008 Jun |
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)
Fingerprint Dive into the research topics of 'State complexity of union and intersection of finite languages'. Together they form a unique fingerprint.
Cite this
Han, Y. S., & Salomaa, K. (2008). State complexity of union and intersection of finite languages. International Journal of Foundations of Computer Science, 19(3), 581-595. https://doi.org/10.1142/S0129054108005838