Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages

Bartek Klin,Slawomir Lasota,Szymon Torunczyk

FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2021（2021）

引用 2|浏览7

暂无评分

摘要

We prove that if a data language and its complement are both recognized by nondeterministic register automata (without guessing), then they are also recognized by deterministic ones.

查看译文

关键词

Data languages, register automata, determinizability, deterministic separability, sets with atoms, orbit-finite sets, nominal sets

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要