Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Simon Beier"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 41-55 (2017)
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear set are: (
Externí odkaz:
https://doaj.org/article/bc817c96fde64e48a4e43071b467cae1
Autor:
Simon Beier, Markus Holzer
Publikováno v:
International Journal of Foundations of Computer Science. 31:805-825
We continue our investigation [S. Beier, M. Holzer: Properties of right one-way jumping finite automata. In Proc. 20th DCFS, LNCS, 2018] on (right) one-way jumping finite automata (ROWJFAs), a variant of jumping automata, which is an automaton model
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a163797df65ad1412564c4dd8cb5c8fc
https://doi.org/10.1142/s0129054120410063
https://doi.org/10.1142/s0129054120410063
Autor:
Markus Holzer, Simon Beier
Publikováno v:
Theoretical Computer Science. 798:78-94
Right one-way jumping finite automata (ROWJFAs), were recently introduced in H. Chigahara et al. (2016) [3] and are jumping automata that process the input in a discontinuous way with the restriction that the input head reads deterministically from l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1829ae610a17bc5f8cdaa4ede9e4a2c
https://doi.org/10.1016/j.tcs.2019.03.044
https://doi.org/10.1016/j.tcs.2019.03.044
Publikováno v:
International Journal of Foundations of Computer Science. 30:5-27
We consider jumping finite automata and their operational state complexity and decidability status. Roughly speaking, a jumping automaton is a finite automaton with a non-continuous input. This device has nice relations to semilinear sets and thus to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da1ab682d8305557545aeb2557469c58
https://doi.org/10.1142/s012905411940001x
https://doi.org/10.1142/s012905411940001x
Autor:
Markus Holzer, Simon Beier
Publikováno v:
Information and Computation. 284:104687
Right-one way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to nondeterministic machines. More precisely we study the impact on the computational power of these mach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5a99b4eaff3602376f64470aa9ad579
https://doi.org/10.1016/j.ic.2021.104687
https://doi.org/10.1016/j.ic.2021.104687
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 52:89-110
We introduce and study the model of diving queue automata which are basically finite automata equipped with a storage medium that is organized as a queue. Additionally, two queue heads are provided at both ends of the queue that can move in a read-on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e632f507eebfd150c52fddf83a89a7df
https://doi.org/10.1051/ita/2018009
https://doi.org/10.1051/ita/2018009
Publikováno v:
AFL
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 41-55 (2017)
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 41-55 (2017)
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear set are: (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bebe2205a9429a6e64c60b581f435808
https://doi.org/10.4204/eptcs.252.8
https://doi.org/10.4204/eptcs.252.8
Autor:
Simon Beier
In formal language theory, the Parikh-image describes the absolute frequencies of symbols in words of a given language. The Parikh-images of regular languages are the same as the ones of context-free languages. These kinds of sets are called semiline
Autor:
Markus Holzer, Simon Beier
Publikováno v:
Implementation and Application of Automata ISBN: 9783030236786
CIAA
CIAA
Right one-way jumping automata (ROWJFAs) are an automaton model that was recently introduced for processing the input in a discontinuous way. In [S. Beier, M. Holzer: Properties of right one-way jumping finite automata. In Proc. 20th DCFS, number 109
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::372c5fe4ec27cf644f6966eb119dd3d1
https://doi.org/10.1007/978-3-030-23679-3_6
https://doi.org/10.1007/978-3-030-23679-3_6
Autor:
Simon Beier, Markus Holzer
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783030232467
DCFS
DCFS
Right one-way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to nondeterministic machines. More precisely we study the impact on the computational power of these mach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8ba71696b8400ec6afc5c0932773255
https://doi.org/10.1007/978-3-030-23247-4_5
https://doi.org/10.1007/978-3-030-23247-4_5