Quotient complexity of regular languages
From MaRDI portal
Publication:5146512
zbMATH Open1456.68083MaRDI QIDQ5146512FDOQ5146512
Authors: Janusz Brzozowski 
Publication date: 26 January 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2009.2
Recommendations
Cited In (14)
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
- Towards a theory of complexity of regular languages
- The full quotient and its closure property for regular languages
- Further Remarks on the Operational Nonterminal Complexity
- Middle quotients of linear languages
- Quotient complexity of ideal languages
- Quotient complexity of closed languages
- Quotient Complexity of Ideal Languages
- Quotient complexity of star-free languages
- On the computation of quotients and factors of regular languages
- On quotients of formal power series
- Language operations with regular expressions of polynomial size
- Symmetric groups and quotient complexity of Boolean operations
- Distinguishability operations and closures
This page was built for publication: Quotient complexity of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146512)
