Institutional Repository
| Deciding determinism of unary languages | |
| Lu, P; Peng, FF; Chen, HM; Zheng, LX | |
| 2015 | |
| Source | INFORMATION AND COMPUTATION
 |
| ISSN | 0890-5401 |
| Volume | 245Pages:181-196 |
| English Abstract | In this paper, we investigate the complexity of deciding determinism of unary languages. First, we give a method to derive a set of arithmetic progressions from a regular expression Eover a unary alphabet, and establish relations between numbers represented by these arithmetic progressions and words in L( E). Next, we define a problem relating to arithmetic progressions and investigate the complexity of this problem. Then by a reduction from this problem we show that deciding determinism of unary languages iscoNPcomplete. Finally, we extend our derivation method to expressions with counting, and prove that deciding whether an expression over a unary alphabet with counting defines a deterministic language is in Pi(p)(2). We also establish a tight upper bound for the size of the minimal DFA for expressions with counting. (C) 2015 Elsevier Inc. Allrightsreserved.; In this paper, we investigate the complexity of deciding determinism of unary languages. First, we give a method to derive a set of arithmetic progressions from a regular expression Eover a unary alphabet, and establish relations between numbers represented by these arithmetic progressions and words in L( E). Next, we define a problem relating to arithmetic progressions and investigate the complexity of this problem. Then by a reduction from this problem we show that deciding determinism of unary languages iscoNPcomplete. Finally, we extend our derivation method to expressions with counting, and prove that deciding whether an expression over a unary alphabet with counting defines a deterministic language is in Pi(p)(2). We also establish a tight upper bound for the size of the minimal DFA for expressions with counting. (C) 2015 Elsevier Inc. Allrightsreserved. |
| Indexed Type | SCI |
| Keyword | Regular Expressions Regular Expressions With Counting Deterministic Languages Minimal Dfa Conp-complete Pi(p)(2) |
| Department | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China. Chinese Acad Sci, Grad Univ, Beijing 100190, Peoples R China. Univ Chinese Acad Sci, Beijing, Peoples R China. Huaqiao Univ, Coll Comp Sci & Technol, Xiamen 361021, Fujian, Peoples R China. |
| Language | 英语 |
| WOS ID | WOS:000368899100012 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/17428 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Lu, P,Peng, FF,Chen, HM,et al. Deciding determinism of unary languages[J]. INFORMATION AND COMPUTATION,2015,245:181-196. |
| APA | Lu, P,Peng, FF,Chen, HM,&Zheng, LX.(2015).Deciding determinism of unary languages.INFORMATION AND COMPUTATION,245,181-196. |
| MLA | Lu, P,et al."Deciding determinism of unary languages".INFORMATION AND COMPUTATION 245(2015):181-196. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 1-s2.0-S089054011500（515KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment