Succinctness of Regular Expressions with Interleaving, Intersection and Counting

DOI10.1007/978-3-540-85238-4_29zbMath1173.68552OpenAlexW1931716395MaRDI QIDQ3599141

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)

Related Items

Functional Specification of Hardware via Temporal Logic, Provably Shorter Regular Expressions from Deterministic Finite Automata, Regular Expressions with Counting: Weak versus Strong Determinism, Tight Bounds on the Descriptional Complexity of Regular Expressions