Towards a theory of complexity of regular languages
From MaRDI portal
Recommendations
Cited in
(35)- Operational complexity and right linear grammars
- On decidability of theories of regular languages
- Language operations with regular expressions of polynomial size
- Language theoretic properties of regular DAG languages
- Relatively regular languages and thin codes
- Regular cubic language and regular cubic expression
- Asymptotic approximation for the quotient complexities of atoms
- The complexity of regular(-like) expressions
- In Search of Most Complex Regular Languages
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
- POWERS OF REGULAR LANGUAGES
- scientific article; zbMATH DE number 1824155 (Why is no real title available?)
- scientific article; zbMATH DE number 3843141 (Why is no real title available?)
- Combinatorial Complexity of Regular Languages
- scientific article; zbMATH DE number 3907802 (Why is no real title available?)
- scientific article; zbMATH DE number 4049104 (Why is no real title available?)
- On the complexity of realization of finite languages by formulas
- The genus of regular languages
- scientific article; zbMATH DE number 1860666 (Why is no real title available?)
- Descriptional complexity of the languages \(KaL\): automata, monoids and varieties
- scientific article; zbMATH DE number 7438576 (Why is no real title available?)
- scientific article; zbMATH DE number 7439745 (Why is no real title available?)
- Quotient complexity of regular languages
- Regular languages viewed from a graph-theoretic perspective
- Symmetric groups and quotient complexity of Boolean operations
- What is a complex regular language?
- In search of most complex regular languages
- scientific article; zbMATH DE number 5218131 (Why is no real title available?)
- Regular Realizability Problems and Context-Free Languages
- Quotient complexity of star-free languages
- State complexity of overlap assembly
- Duality of Lattices Associated to Left and Right Quotients
- Language quotients revisited
- Regularity of a dynamic neighborhood of a regular language
- Asymptotic approximation by regular languages
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)
