Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Martin Berglund"'
Publikováno v:
Algorithms, Vol 17, Iss 6, p 268 (2024)
A regular unranked tree folding consists of a regular unranked tree language and a folding operation that merges (i.e., folds) selected nodes of a tree to form a graph; the combination is a formal device for representing graph languages. If, in the p
Externí odkaz:
https://doaj.org/article/38f4c5e18400400493e452dd290828bf
Publikováno v:
Journal of Universal Computer Science, Vol 27, Iss 4, Pp 324-340 (2021)
This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads. We show how to translate regular expressions with lookaheads (REwLA) to equivalent Boolean automata hav
Externí odkaz:
https://doaj.org/article/51f60df547f54f86a3dd2f52807932fe
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 109-123 (2014)
We develop a formal perspective on how regular expression matching works in Java, a popular representative of the category of regex-directed matching engines. In particular, we define an automata model which captures all the aspects needed to study s
Externí odkaz:
https://doaj.org/article/ec14689490654d7baecf7fdb554af28b
Publikováno v:
PLoS ONE, Vol 10, Iss 9, p e0138538 (2015)
Mathematical models may help the analysis of biological systems by providing estimates of otherwise un-measurable quantities such as concentrations and fluxes. The variability in such systems makes it difficult to translate individual characteristics
Externí odkaz:
https://doaj.org/article/21532515ae794d19a12e741930a3ea13
Publikováno v:
Algorithms, Vol 9, Iss 2, p 32 (2016)
Parsing for mildly context-sensitive language formalisms is an important area within natural language processing. While the complexity of the parsing problem for some such formalisms is known to be polynomial, this is not the case for all of them. Th
Externí odkaz:
https://doaj.org/article/9803c0d69a22410b866f33ba9b95402c
Autor:
Martin Berglund, Brink van der Merwe
Publikováno v:
Theoretical Computer Science. 940:66-80
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e62ea103f7f78fa2bacf021960bded4e
https://doi.org/10.1016/j.tcs.2022.10.041
https://doi.org/10.1016/j.tcs.2022.10.041
Publikováno v:
JUCS-Journal of Universal Computer Science 27(4): 324-340
Journal of Universal Computer Science, Vol 27, Iss 4, Pp 324-340 (2021)
Journal of Universal Computer Science, Vol 27, Iss 4, Pp 324-340 (2021)
This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads. We show how to translate regular expressions with lookaheads (REwLA) to equivalent Boolean automata hav
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b9a5e3019bcdbc1df0e1925d1a9e8e9
https://doi.org/10.3897/jucs.66330
https://doi.org/10.3897/jucs.66330
Publikováno v:
Theoretical Computer Science. 857:147-165
Whereas Perl-compatible regular expression matchers typically exhibit some variation of leftmost-greedy semantics, those conforming to the posix standard are prescribed leftmost-longest semantics. However, the posix standard leaves some room for inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65a6626aef6afeeca32337d61a839e24
https://doi.org/10.1016/j.tcs.2021.01.010
https://doi.org/10.1016/j.tcs.2021.01.010
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1eb775dabfd36e9257f8e0ebf9ae441
https://doi.org/10.2139/ssrn.4291269
https://doi.org/10.2139/ssrn.4291269
Autor:
Brink van der Merwe, Martin Berglund
Publikováno v:
Implementation and Application of Automata ISBN: 9783031074684
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88bf4bf557fc7d1e0f458d9a03b9be3c
https://doi.org/10.1007/978-3-031-07469-1_4
https://doi.org/10.1007/978-3-031-07469-1_4
