Definability by Weakly Deterministic Regular Expressions with Counters is Decidable.

Lecture Notes in Computer Science（2015）

引用 12|浏览34

暂无评分

摘要

We show that weakly deterministic regular expressions with counters (WDREs) -as they are used in XML Schema- are at most exponentially larger than equivalent DFAs. As a consequence, the problem, whether a given DFA is equivalent to any WDRE, is decidable in EXPSPACE.

查看译文

关键词

Normal Form, Regular Expression, Regular Language, Parse Tree, Alphabet Symbol

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要