Extended Regular Expressions: Succinctness and Decidability

DOI10.4230/LIPIcs.STACS.2011.507zbMath1230.68129OpenAlexW2159133812MaRDI QIDQ3113715

Dominik D. Freydenberger

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_5c09.html

zbMATH Keywords

decidabilityextended regular expressionsnon-recursive tradeoffsregex

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Extended regular expressions: succinctness and decidability ⋮ Expressiveness and static analysis of extended conjunctive regular path queries ⋮ Inclusion problems for patterns with a bounded number of variables ⋮ Document Spanners

This page was built for publication: Extended Regular Expressions: Succinctness and Decidability