INSIDE THE CLASS OF REGEX LANGUAGES

DOI10.1142/S0129054113400340zbMath1293.68189MaRDI QIDQ5495423

Markus L. Schmid

Publication date: 4 August 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

pattern languagesextended regular expressionspattern expressionshomomorphic replacementREGEX

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Characterising REGEX languages by regular languages equipped with factor-referencing ⋮ On the undecidability and descriptional complexity of synchronized regular expressions ⋮ Deterministic regular expressions with back-references ⋮ Pattern matching with variables: a multivariate complexity analysis

Cites Work

• Complexity of multi-head finite automata: origins and directions
• Pattern expressions and pattern automata
• Languages with homomorphic replacements
• Synchronized regular expressions
• Extending regular expressions with homomorphic replacement
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS

This page was built for publication: INSIDE THE CLASS OF REGEX LANGUAGES