Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing

DOI10.1007/978-3-319-09698-8_13zbMath1344.68129OpenAlexW2180604834MaRDI QIDQ2921979

Markus L. Schmid

Publication date: 14 October 2014

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09698-8_13

zbMATH Keywords

regular languagesmemory automataREGEX languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15)

Related Items (2)

Characterising REGEX languages by regular languages equipped with factor-referencing ⋮ Re-examining regular expressions with backreferences

Uses Software

• PERL
• Python

This page was built for publication: Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing