Author:
Indzhev Emil,Kiefer Stefan
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference5 articles.
1. Operations on unambiguous finite automata;Jirásek;Int. J. Found. Comput. Sci.,2018
2. Partial orders on words, minimal elements of regular languages, and state complexity;Birget;Theor. Comput. Sci.,1993
3. State complexity of some operations on binary regular languages;Jirásková;Theor. Comput. Sci.,2005
4. A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton;Raskin,2018
5. Unambiguity in automata theory;Colcombet,2015
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献