Funder
Vedecká Grantová Agentúra MŠVVaŠ SR a SAV
European Regional Development Fund
Subject
General Computer Science,Theoretical Computer Science
Reference35 articles.
1. Intersection and union of regular languages and state complexity;Birget;Inf. Process. Lett.,1992
2. Determination of finite automata accepting subregular languages;Bordihn;Theor. Comput. Sci.,2009
3. Roots of star events;Brzozowski;J. ACM,1967
4. Tight lower bound for the state complexity of shuffle of regular languages;Câmpeanu;J. Autom. Lang. Comb.,2002
5. Operations on automata with all states final;Čevorová,2014