Cuts in regular expressions
From MaRDI portal
Publication:5300830
DOI10.1007/978-3-642-38771-5_8zbMATH Open1381.68108OpenAlexW2128263261MaRDI QIDQ5300830FDOQ5300830
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
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 (9)
- On the semantics of atomic subgroups in practical regular expressions
- Derivatives of regular expressions with cuts
- The cut operation in subclasses of convex languages
- On the semantics of regular expression parsing in the wild
- Operational complexity: NFA-to-DFA trade-off
- Tight bounds for cut-operations on deterministic finite automata
- The cut operation in subclasses of convex languages (extended abstract)
- On the semantics of regular expression parsing in the wild
- Operations on Permutation Automata
Uses Software
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)
