Author:
Klin Bartek,Lasota Sławomir,Toruńczyk Szymon
Abstract
AbstractWe 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.
Publisher
Springer International Publishing
Reference26 articles.
1. M. Bojańczyk. Slightly infinite sets. A draft of a book available at https://www.mimuw.edu.pl/~bojan/paper/atom-book.
2. M. Bojanczyk. Data monoids. In Proc. STACS 2011, volume 9 of LIPIcs, pages 105–116. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011.
3. M. Bojańczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data words. ACM Trans. Comput. Log., 12(4):27:1–27:26, 2011.
4. M. Bojańczyk, B. Klin, and S. Lasota. Automata with group actions. In Proc. LICS 2011, pages 355–364, 2011.
5. M. Bojańczyk, B. Klin, and S. Lasota. Automata theory in nominal sets. Log. Methods Comput. Sci., 10(3), 2014.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Determinisability of register and timed automata;Logical Methods in Computer Science;2022-05-10