Funder
Vedecká Grantová Agentúra MŠVVaŠ SR a SAV
Subject
General Computer Science,Theoretical Computer Science
Reference36 articles.
1. Descriptional complexity of power and positive closure on convex languages;Hospodár,2019
2. Estimates of the number of states of finite automata;Maslov;Sov. Math. Dokl.,1970
3. The state complexities of some basic operations on regular languages;Yu;Theor. Comput. Sci.,1994
4. Nondeterministic descriptional complexity of regular languages;Holzer;Int. J. Found. Comput. Sci.,2003
5. Unary language operations, state complexity and Jacobsthal's function;Pighizzini;Int. J. Found. Comput. Sci.,2002
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Conversions Between Six Models of Finite Automata;International Journal of Foundations of Computer Science;2024-08-02
2. On discrete properties of Bernoulli shift;International Journal of Geometric Methods in Modern Physics;2024-03-15
3. Operations on Boolean and Alternating Finite Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-03
4. Nondeterministic operational complexity in subregular languages;Theoretical Computer Science;2023-09
5. Closure Properties of Subregular Languages Under Operations;International Journal of Foundations of Computer Science;2023-05-04