A Study of a Simple Class of Modifiers: Product Modifiers
From MaRDI portal
Recommendations
- New tools for state complexity
- Combination of roots and Boolean operations: an application to state complexity
- Algebraic and combinatorial tools for state complexity: application to the star-xor problem
- The state complexities of some basic operations on regular languages
- State complexity of prefix, suffix, bifix and infix operators on regular languages
Cites work
- A general approach to state complexity of operations: formalization and limitations
- A survey on operational state complexity
- Algebraic and combinatorial tools for state complexity: application to the star-xor problem
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 2068872 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- New tools for state complexity
- On the State Complexity of the Shuffle of Regular Languages
- State complexity of catenation combined with a Boolean operation: a unified approach
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- State complexity of cyclic shift
- State complexity of power
- State complexity of regular languages
- State complexity of some operations on binary regular languages
This page was built for publication: A Study of a Simple Class of Modifiers: Product Modifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041253)