default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Berglund
Person information
- affiliation: Umeå University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Martin Berglund
, Henrik Björklund, Johanna Björklund:
Parsing Unranked Tree Languages, Folded Once. Algorithms 17(6): 268 (2024)- [c20]Martin Berglund, Willeke Martens, Brink van der Merwe:
Constructing a BPE Tokenization DFA. CIAA 2024: 66-78 - [i1]Martin Berglund, Willeke Martens, Brink van der Merwe:
Constructing a BPE Tokenization DFA. CoRR abs/2405.07671 (2024) - 2023
- [j8]Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret:
Transduction from trees to graphs through folding. Inf. Comput. 295(Part B): 105111 (2023) - [j7]Martin Berglund, Brink van der Merwe:
Re-examining regular expressions with backreferences. Theor. Comput. Sci. 940(Part): 66-80 (2023) - [c19]Martin Berglund, Henrik Björklund, Johanna Björklund:
Parsing Unranked Tree Languages, Folded Once. FCT 2023: 60-73 - [c18]Martin Berglund, Brink van der Merwe:
Formalizing BPE Tokenization. NCMA 2023: 16-27 - 2022
- [c17]Brink van der Merwe, Martin Berglund:
Ordered Context-Free Grammars. CIAA 2022: 53-66 - 2021
- [j6]Martin Berglund, Brink van der Merwe, Steyn van Litsenborgh:
Regular Expressions with Lookahead. J. Univers. Comput. Sci. 27(4): 324-340 (2021) - [j5]Martin Berglund, Willem Bester, Brink van der Merwe:
Formalising and implementing Boost POSIX regular expression matching. Theor. Comput. Sci. 857: 147-165 (2021) - [c16]Brink van der Merwe, Jacobie Mouton, Steyn van Litsenborgh, Martin Berglund:
Memoized Regular Expressions. CIAA 2021: 39-52
2010 – 2019
- 2018
- [j4]Martin Berglund, Frank Drewes, Brink van der Merwe:
The Output Size Problem for String-to-Tree Transducers. J. Autom. Lang. Comb. 23(1-3): 19-38 (2018) - [c15]Martin Berglund, Ina Schaefer:
An Automata-Based View on Configurability and Uncertainty. ICTAC 2018: 80-98 - [c14]Martin Berglund, Willem Bester, Brink van der Merwe:
Formalising Boost POSIX Regular Expression Matching. ICTAC 2018: 99-115 - [c13]Martin Berglund, Frank Drewes, Brink van der Merwe:
On regular expressions with backreferences and transducers. NCMA 2018: 49-64 - 2017
- [j3]Martin Berglund, Brink van der Merwe:
On the semantics of regular expression parsing in the wild. Theor. Comput. Sci. 679: 69-82 (2017) - [c12]Brink van der Merwe, Nicolaas Weideman, Martin Berglund:
Turning evil regexes harmless. SAICSIT 2017: 38:1-38:10 - [c11]Martin Berglund, Brink van der Merwe:
Regular Expressions with Backreferences Re-examined. Stringology 2017: 30-41 - [c10]Martin Berglund, Henrik Björklund, Frank Drewes:
Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages. TAG 2017: 94-101 - [c9]Martin Berglund, Brink van der Merwe, Bruce W. Watson, Nicolaas Weideman:
On the Semantics of Atomic Subgroups in Practical Regular Expressions. CIAA 2017: 14-26 - 2016
- [j2]Henrik Björklund, Martin Berglund, Petter Ericson:
Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey. Algorithms 9(2): 32 (2016) - [c8]Nicolaas Weideman, Brink van der Merwe, Martin Berglund, Bruce W. Watson:
Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA. CIAA 2016: 322-334 - 2015
- [c7]Martin Berglund, Brink van der Merwe:
On the Semantics of Regular Expression Parsing in the Wild. CIAA 2015: 292-304 - 2014
- [b1]Martin Berglund:
Complexities of Order-Related Formal Language Extensions. Umea University, Sweden, 2014 - [c6]Martin Berglund, Frank Drewes, Brink van der Merwe:
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching. AFL 2014: 109-123 - 2013
- [j1]Martin Berglund, Henrik Björklund, Johanna Björklund:
Shuffled languages - Representation and recognition. Theor. Comput. Sci. 489-490: 1-20 (2013) - [c5]Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson:
Cuts in Regular Expressions. Developments in Language Theory 2013: 70-81 - [c4]Martin Berglund, Henrik Björklund, Frank Drewes:
On the Parameterized Complexity of Linear Context-Free Rewriting Systems. MOL 2013: 21-29 - 2011
- [c3]Martin Berglund, Henrik Björklund, Johanna Högberg:
Recognizing Shuffled Languages. LATA 2011: 142-154 - [c2]Martin Berglund:
Analyzing Edit Distance on Trees: Tree Swap Distance is Intractable. Stringology 2011: 59-72 - 2010
- [c1]Martin Berglund, Frank Drewes:
On the Complexity of Variants of the k Best Strings Problem. Stringology 2010: 76-88
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
