Towards a theory of complexity of regular languages
From MaRDI portal
Publication:5376331
DOI10.25596/JALC-2018-067zbMATH Open1398.68300arXiv1702.05024MaRDI QIDQ5376331FDOQ5376331
Authors: Janusz Brzozowski 
Publication date: 17 September 2018
Full work available at URL: https://arxiv.org/abs/1702.05024
Recommendations
regular languagestaratomconcatenationstate complexityreversalBoolean operationconvex languagecomplexity measuresyntactic semigroupquotient complexityunrestricted complexitymost complex language
Cited In (22)
- The complexity of regular(-like) expressions
- POWERS OF REGULAR LANGUAGES
- Asymptotic approximation by regular languages
- Relatively regular languages and thin codes
- In Search of Most Complex Regular Languages
- State Complexity of Overlap Assembly
- Title not available (Why is that?)
- Regular Realizability Problems and Context-Free Languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- On decidability of theories of regular languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language theoretic properties of regular DAG languages
- Duality of Lattices Associated to Left and Right Quotients
- Combinatorial Complexity of Regular Languages
- On the complexity of realization of finite languages by formulas
- Language operations with regular expressions of polynomial size
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
This page was built for publication: Towards a theory of complexity of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376331)
