Succinctness of Regular Expressions with Interleaving, Intersection and Counting

DOI10.1007/978-3-540-85238-4_29MaRDI QIDQ3599141zbMATH OpenOpenAlexFDO

Authors Wouter Gelade

Publication date 3 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1942/12824

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Succinctness of regular expressions with interleaving, intersection and counting
• Succinctness of the complement and intersection of regular expressions
• Succinctness of the Complement and Intersection of Regular Expressions
• Tight Bounds on the Descriptional Complexity of Regular Expressions
• Deterministic regular expressions with interleaving

Cited in

(10)

• Intersection of \(-\omega \)-regular expressions
• Context-free grammars for deterministic regular expressions with interleaving
• Deterministic regular expressions with interleaving
• Succinctness of the Complement and Intersection of Regular Expressions
• Functional specification of hardware via temporal logic
• Provably Shorter Regular Expressions from Deterministic Finite Automata
• Tight Bounds on the Descriptional Complexity of Regular Expressions
• Succinctness of the complement and intersection of regular expressions
• Regular Expressions with Counting: Weak versus Strong Determinism
• Succinctness of regular expressions with interleaving, intersection and counting

This page was built for publication: Succinctness of Regular Expressions with Interleaving, Intersection and Counting

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