Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Kaito Hoshi"'
Publikováno v:
Theoretical Computer Science. 864:92-102
The recently introduced one-way jumping automata are strictly more powerful than classical finite automata (FA) while maintaining decidability in most of the important cases. We investigate the extension of the new processing mode to two-way determin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e5bb8cbe1fbb1d592d6ab6a4b5a0afe
https://doi.org/10.1016/j.tcs.2021.02.030
https://doi.org/10.1016/j.tcs.2021.02.030
Publikováno v:
Frontiers in Algorithmics ISBN: 9783030599003
FAW
FAW
The recently introduced one-way jumping automata are strictly more powerful than classical finite automata (FA) while maintaining decidability in most of the important cases. We investigate the extension of the new processing mode to two-way determin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70ba964c4140f32e43bc84a53e47add1
https://doi.org/10.1007/978-3-030-59901-0_10
https://doi.org/10.1007/978-3-030-59901-0_10
Publikováno v:
Cellular Automata and Discrete Complex Systems ISBN: 9783030209803
Automata
Automata
Recently, new types of non-sequential machine models have been introduced and studied, such as jumping automata and one-way jumping automata. We study the abilities and limitations of automata with these two jumping modes of tape heads with respect t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ded0cc5aeeb7d721e0d292b65f2e240
https://doi.org/10.1007/978-3-030-20981-0_5
https://doi.org/10.1007/978-3-030-20981-0_5