Institutional Repository
| Deciding Determinism of Regular Languages | |
| Lu, Ping (1); Bremer, Joachim (2); Chen, Haiming (1); Lu, Ping | |
| 2014 | |
| Source | Theory of Computing Systems
 |
| ISSN | 14324350 |
| English Abstract | We investigate the problem to decide for DFAs, NFAs and regular expressions whether they describe deterministic regular languages. For DFAs with limited alphabet size we show the NL-completeness (nondeterministic logarithmic space-completeness) of the problem. Brüggemann-Klein and Wood (Inf. Comput. 142(2), 182–206, (1998)) gave an algorithm deciding for a minimal DFA whether it recognizes a deterministic regular language. Their algorithm requires polynomial time. Based on this algorithm we construct an algorithm for those DFAs which are not necessarily minimal, but limited in the size of the alphabet. We first focus on the case that the DFAs are minimal and extend to general DFAs later on. The new algorithm is substantially modified in contrast to the original one and uses structural properties of minimal DFAs and of special subautomata of the DFAs, called orbit automata. This algorithm runs in nondeterministic logarithmic space. After that we show the NL-hardness of the problem. For NFAs and regular expressions with arbitrary alphabets the problem is shown to be in PSPACE by Czerwiski et al. (2013) (and, in fact, to be PSPACE-complete). Their approach resulted in an algorithm working with space (Formula presented.). However, our approach for the NL-algorithm can be modified to get an algorithm for NFAs and regular expressions using just quadratic space.; We investigate the problem to decide for DFAs, NFAs and regular expressions whether they describe deterministic regular languages. For DFAs with limited alphabet size we show the NL-completeness (nondeterministic logarithmic space-completeness) of the problem. Brüggemann-Klein and Wood (Inf. Comput. 142(2), 182–206, (1998)) gave an algorithm deciding for a minimal DFA whether it recognizes a deterministic regular language. Their algorithm requires polynomial time. Based on this algorithm we construct an algorithm for those DFAs which are not necessarily minimal, but limited in the size of the alphabet. We first focus on the case that the DFAs are minimal and extend to general DFAs later on. The new algorithm is substantially modified in contrast to the original one and uses structural properties of minimal DFAs and of special subautomata of the DFAs, called orbit automata. This algorithm runs in nondeterministic logarithmic space. After that we show the NL-hardness of the problem. For NFAs and regular expressions with arbitrary alphabets the problem is shown to be in PSPACE by Czerwiski et al. (2013) (and, in fact, to be PSPACE-complete). Their approach resulted in an algorithm working with space (Formula presented.). However, our approach for the NL-algorithm can be modified to get an algorithm for NFAs and regular expressions using just quadratic space. |
| Indexed Type | EI |
| Department | (1) State Key Laboratory of Computer Science Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Institut fr Informatik, Goethe-Universitt, Frankfurt am Main, Germany |
| Language | 英语 |
| WOS ID | WOS:000358741300004 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/17037 |
| Collection | 中国科学院软件研究所 |
| Corresponding Author | Lu, Ping |
| Recommended Citation GB/T 7714 | Lu, Ping ,Bremer, Joachim ,Chen, Haiming ,et al. Deciding Determinism of Regular Languages[J]. Theory of Computing Systems,2014. |
| APA | Lu, Ping ,Bremer, Joachim ,Chen, Haiming ,&Lu, Ping.(2014).Deciding Determinism of Regular Languages.Theory of Computing Systems. |
| MLA | Lu, Ping ,et al."Deciding Determinism of Regular Languages".Theory of Computing Systems (2014). |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment