Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Maris Valdats"'
Autor:
Maris Valdats
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 342-354 (2014)
In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ exponential
Externí odkaz:
https://doaj.org/article/e6ed1007f44c4c0ab2a89faeb575b42f
Autor:
Maris Valdats
Publikováno v:
Baltic Journal of Modern Computing. 7
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata --
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4014569ce7c69f84c029d95dd544e722
https://doi.org/10.22364/bjmc.2019.7.3.02
https://doi.org/10.22364/bjmc.2019.7.3.02
Autor:
Maris Valdats
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783642225994
DCFS
DCFS
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata --
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea16066c7dbce86359eb6637643b6149
https://doi.org/10.1007/978-3-642-22600-7_24
https://doi.org/10.1007/978-3-642-22600-7_24
Publikováno v:
STACS 2001 ISBN: 9783540416951
STACS
STACS
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3896b2615196ffeea37986343de68258
https://doi.org/10.1007/3-540-44693-1_7
https://doi.org/10.1007/3-540-44693-1_7