Commutative regular languages with product-form minimal automata
From MaRDI portal
Publication:2096583
Recommendations
- Commutative regular languages -- properties and state complexity
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
- On the State Complexity of the Shuffle of Regular Languages
- scientific article; zbMATH DE number 1222104
- State complexity bounds for the commutative closure of group languages
Cites work
- scientific article; zbMATH DE number 3463159 (Why is no real title available?)
- scientific article; zbMATH DE number 3514949 (Why is no real title available?)
- scientific article; zbMATH DE number 1916664 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- A survey on operational state complexity
- Characterizations of locally testable events
- Commutative regular languages -- properties and state complexity
- Inferring regular trace languages from positive and negative samples
- Learning Commutative Regular Languages
- More on the Size of Higman-Haines Sets: Effective Constructions
- On Shuffle Ideals
- On a structural property in the state complexity of projected regular languages
- On regularity of context-free languages
- On the State Complexity of the Shuffle of Regular Languages
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- On the state complexity of scattered substrings and superstrings
- Regular languages and partial commutations
- Software Descriptions with Flow Expressions
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
- State complexity of projection on languages recognized by permutation automata and commuting letters
- The size of Higman-Haines sets
- The state complexities of some basic operations on regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(3)- State complexity bounds for the commutative closure of group languages
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
This page was built for publication: Commutative regular languages with product-form minimal automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096583)
