A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
From MaRDI portal
Publication:5696950
DOI10.1142/S012905410300214XzbMath1101.68443OpenAlexW2083735143WikidataQ63112201 ScholiaQ63112201MaRDI QIDQ5696950
Kai Salomaa, Sheng Yu, Cezar Campeanu
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905410300214x
Related Items
Pattern expressions and pattern automata, Characterising REGEX languages by regular languages equipped with factor-referencing, On the parameterised complexity of string morphism problems, Document spanners: from expressive power to decision problems, How to settle the ReDoS problem: back to the classical automata theory, Inferring descriptive generalisations of formal languages, Extended regular expressions: succinctness and decidability, Expressiveness and static analysis of extended conjunctive regular path queries, Regular and context-free pattern languages over small alphabets, Inclusion problems for patterns with a bounded number of variables, Matching patterns with variables under edit distance, Regular languages with variables on graphs, On the undecidability and descriptional complexity of synchronized regular expressions, Re-examining regular expressions with backreferences, Bad News on Decision Problems for Patterns, A note on the complexity of matching patterns with variables, Patterns with bounded treewidth, Document Spanners, On Extended Regular Expressions, A Polynomial Time Match Test for Large Classes of Extended Regular Expressions, Generating all minimal Petri net unsolvable binary words, On the closure of pattern expressions languages under intersection with regular languages, On the intersection of regex languages with regular languages, Deterministic regular expressions with back-references, Unnamed Item, GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012, INSIDE THE CLASS OF REGEX LANGUAGES, On the language equivalence of NE star-patterns, Annotated regular expressions and input-driven languages, Bad news on decision problems for patterns, Pattern matching with variables: a multivariate complexity analysis, On the semantics of regular expression parsing in the wild
Cites Work
