Regular Expressions with Counting: Weak versus Strong Determinism
From MaRDI portal
Publication:5895105
DOI10.1007/978-3-642-03816-7_32zbMath1250.68158MaRDI QIDQ5895105
Wim Martens, Marc Gyssens, Wouter Gelade
Publication date: 16 October 2009
Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/13185
68Q45: Formal languages and automata
Related Items
Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking, The tractability frontier for NFA minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient inclusion for a class of XML types with interleaving and counting
- Regular expressions into finite automata
- One-unambiguity of regular expressions with numeric occurrence indicators
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Succinctness of Regular Expressions with Interleaving, Intersection and Counting
- Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
- Mathematical Foundations of Computer Science 2004
- From Monadic Logic to PSL
- Automata, Languages and Programming
- One-unambiguous regular languages