Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Mohammad Zakzok"'
Publikováno v:
Acta Informatica. 59:619-669
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::baaedee94a7339f2c6857835398f752f
https://doi.org/10.1007/s00236-021-00414-w
https://doi.org/10.1007/s00236-021-00414-w
Autor:
Christos A. Kapoutsis, Mohammad Zakzok
Publikováno v:
Theoretical Computer Science. 870:75-102
The study of alternation in two-way finite automata ( 2 fa s) has been quite non-systematic. Since the 1970's, various authors with a variety of motivations have studied 2 fa s with various types of alternation and a variety of names, creating a fair
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9eaa374365621bc34e57d6819c39972
https://doi.org/10.1016/j.tcs.2020.12.011
https://doi.org/10.1016/j.tcs.2020.12.011
Publikováno v:
Acta Informatica. 58:463-495
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::613c6929ceb9a36b8a8975ab5a0ca2f8
https://doi.org/10.1007/s00236-020-00373-8
https://doi.org/10.1007/s00236-020-00373-8
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783030134341
LATA
LATA
We introduce a polynomial-size oracle hierarchy for one-way finite automata. In it, a problem is in level k (resp., level 0) if itself or its complement is solved by a polynomial-size nondeterministic finite automaton with access to an oracle for a p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::834d99cfa4ac6a8472d31bf8ef6ce6c0
https://doi.org/10.1007/978-3-030-13435-8_4
https://doi.org/10.1007/978-3-030-13435-8_4
