Games for succinctness of regular expressions
From MaRDI portal
Publication:6649529
DOI10.4204/EPTCS.346.17MaRDI QIDQ6649529FDOQ6649529
Authors: Miikka Vilander 
Publication date: 6 December 2024
Cites Work
- Succinctness of the Complement and Intersection of Regular Expressions
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- Tight Bounds on the Descriptional Complexity of Regular Expressions
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Title not available (Why is that?)
- Regular expressions: new results and open problems
- Title not available (Why is that?)
- Transition graphs and the star-height of regular events
- An n ! lower bound on formula size
- Succinctness of regular expressions with interleaving, intersection and counting
- Algorithms for determining relative star height and star height
- Title not available (Why is that?)
- Classifying regular languages by a split game
This page was built for publication: Games for succinctness of regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649529)
