Deciding determinism of unary languages
文献类型：期刊论文
| 作者 | Lu, P ; Peng, FF ; Chen, HM ; Zheng, LX |
| 刊名 | INFORMATION AND COMPUTATION
 |
| 出版日期 | 2015 |
| 卷号 | 245页码:181-196 |
| 关键词 | Regular expressions Regular expressions with counting Deterministic languages Minimal DFA coNP-complete Pi(p)(2) |
| ISSN号 | 0890-5401 |
| 中文摘要 | 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. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000368899100012 |
| 公开日期 | 2016-12-13 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/17428]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。