On the computation of quotients and factors of regular languages
From MaRDI portal
(Redirected from Publication:351995)
Recommendations
- Quotient complexity of regular languages
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Quotient complexities of atoms of regular languages
- scientific article; zbMATH DE number 3974329
- The full quotient and its closure property for regular languages
- scientific article; zbMATH DE number 2162119
- On the structure and complexity of rational sets of regular languages
- Quotient complexities of atoms in regular ideal languages
- Quotients of Context-Free Languages
Cites work
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 2162119 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Derivatives of Regular Expressions
- On the decomposition of finite languages
- Partial derivatives of regular expressions and finite automaton constructions
Cited in
(5)- A non-ambiguous decomposition of regular languages and factorizing codes
- Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
- Factor theory and the unity of opposites
- Some properties of inclusions of multisets and contractive Boolean operators
- On the Quantized Dynamics of Factorial Languages
This page was built for publication: On the computation of quotients and factors of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351995)
