Cuts in regular expressions

DOI10.1007/978-3-642-38771-5_8MaRDI QIDQ5300830zbMATH OpenOpenAlexFDO

Authors Martin Berglund, Henrik Björklund, Brink van der Merwe, Frank Drewes, B. W. Watson

Publication date 28 June 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-38771-5_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Derivatives of regular expressions with cuts
• On the semantics of atomic subgroups in practical regular expressions
• Extended Regular Expressions: Succinctness and Decidability
• Extended regular expressions: succinctness and decidability
• Succinctness of regular expressions with interleaving, intersection and counting

Cited in

(11)

• The cut operation in subclasses of convex languages (extended abstract)
• On the semantics of regular expression parsing in the wild
• On the semantics of atomic subgroups in practical regular expressions
• Tight bounds for cut-operations on deterministic finite automata
• On the semantics of regular expression parsing in the wild
• Derivatives of regular expressions with cuts
• Operations on Permutation Automata
• The cut operation in subclasses of convex languages
• Operational complexity: NFA-to-DFA trade-off
• Operational complexity in subregular classes
• The ranges of state and accepting state complexities for the cut operation

Describes a project that uses

Uses Software

• PERL

This page was built for publication: Cuts in regular expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300830)