Abstract
Recently, researchers studied the state complexity of boundary - L∗ ∩Lc∗ - of regular languages L motivated from the famous Kuratowski's 14-theorem. Prefix codes - a set of languages - play an important role in several applications. We consider prefix- free regular languages and investigate the state complexity of two operations, L∗ and L∗ ∩Lc∗ for prefix-free regular languages. Based on the unique structural properties of a prefix-free minimal DFA, we compute the precise state complexity of L∗ and L∗ ∩Lc∗. We then present the tight bound over a quaternary alphabet for L∗ and L∗ ∩Lc∗. Our results are smaller than the composition of the state complexity function for individual operations of prefix-free regular languages.
| Original language | English |
|---|---|
| Pages (from-to) | 697-707 |
| Number of pages | 11 |
| Journal | International Journal of Foundations of Computer Science |
| Volume | 26 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 2015 Sep 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)
Cite this
}
State Complexity of Boundary of Prefix-Free Regular Languages. / Eom, Hae Sung; Han, Yo Sub.
In: International Journal of Foundations of Computer Science, Vol. 26, No. 6, 01.09.2015, p. 697-707.Research output: Contribution to journal › Article
TY - JOUR
T1 - State Complexity of Boundary of Prefix-Free Regular Languages
AU - Eom, Hae Sung
AU - Han, Yo Sub
PY - 2015/9/1
Y1 - 2015/9/1
N2 - Recently, researchers studied the state complexity of boundary - L∗ ∩Lc∗ - of regular languages L motivated from the famous Kuratowski's 14-theorem. Prefix codes - a set of languages - play an important role in several applications. We consider prefix- free regular languages and investigate the state complexity of two operations, L∗ and L∗ ∩Lc∗ for prefix-free regular languages. Based on the unique structural properties of a prefix-free minimal DFA, we compute the precise state complexity of L∗ and L∗ ∩Lc∗. We then present the tight bound over a quaternary alphabet for L∗ and L∗ ∩Lc∗. Our results are smaller than the composition of the state complexity function for individual operations of prefix-free regular languages.
AB - Recently, researchers studied the state complexity of boundary - L∗ ∩Lc∗ - of regular languages L motivated from the famous Kuratowski's 14-theorem. Prefix codes - a set of languages - play an important role in several applications. We consider prefix- free regular languages and investigate the state complexity of two operations, L∗ and L∗ ∩Lc∗ for prefix-free regular languages. Based on the unique structural properties of a prefix-free minimal DFA, we compute the precise state complexity of L∗ and L∗ ∩Lc∗. We then present the tight bound over a quaternary alphabet for L∗ and L∗ ∩Lc∗. Our results are smaller than the composition of the state complexity function for individual operations of prefix-free regular languages.
UR - http://www.scopus.com/inward/record.url?scp=84947221178&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84947221178&partnerID=8YFLogxK
U2 - 10.1142/S0129054115500392
DO - 10.1142/S0129054115500392
M3 - Article
AN - SCOPUS:84947221178
VL - 26
SP - 697
EP - 707
JO - International Journal of Foundations of Computer Science
JF - International Journal of Foundations of Computer Science
SN - 0129-0541
IS - 6
ER -