Regular languages and partial commutations
From MaRDI portal
Recommendations
- Commutative regular languages -- properties and state complexity
- scientific article; zbMATH DE number 4009839
- Combinatorial Complexity of Regular Languages
- A note on equations for commutative regular languages
- Regular languages in \(NC\)
- Learning Commutative Regular Languages
- Regular languages of plus- and minus-(in)decomposable permutations
- Partially-commutative context-free languages
- Regular languages of partial words
- Powers of Regular Languages
Cites work
- scientific article; zbMATH DE number 3970130 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 1259068 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 2040895 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2143013 (Why is no real title available?)
- scientific article; zbMATH DE number 6168299 (Why is no real title available?)
- scientific article; zbMATH DE number 3261629 (Why is no real title available?)
- scientific article; zbMATH DE number 3424273 (Why is no real title available?)
- A Star Operation for Star-Free Trace Languages
- A note on the commutative closure of star-free languages
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- Bounded Regular Sets
- Complement reducible graphs
- Efficiency of automata in semi-commutation verification techniques
- On hereditary properties of the class of graphs with convex quadratic stability number
- On total regulators generated by derivation relations
- Paw-free graphs
- Permutation rewriting and algorithmic verification
- Polynomial closure and unambiguous product
- Polynomial closure of group languages and open sets of the Hall topology
- SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS
- Semi-commutations
- Semigroups, Presburger formulas, and languages
- Shuffle on positive varieties of languages
- Star-free star and trace languages
- When Does Partial Commutative Closure Preserve Regularity?
Cited in
(28)- Commutative regular languages with product-form minimal automata
- Regular languages of nested words: fixed points, automata, and synchronization
- Hairpin Lengthening and Shortening of Regular Languages
- The Shuffle Product: New Research Directions
- Geometrically closed positive varieties of languages
- Commutative languages and their composition by consensual methods
- Relatively regular languages and thin codes
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- The commutative closure of shuffle languages over group languages is regular
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
- Regular binoid expressions and regular binoid languages.
- Overlap-Free Regular Languages
- scientific article; zbMATH DE number 1944129 (Why is no real title available?)
- State complexity bounds for the commutative closure of group languages
- Language theoretic properties of regular DAG languages
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- A Robust Class of Regular Languages
- Duality and Equational Theory of Regular Languages
- scientific article; zbMATH DE number 3986658 (Why is no real title available?)
- Partial Commutation on Array Languages
- scientific article; zbMATH DE number 7444007 (Why is no real title available?)
- POWERS OF REGULAR LANGUAGES
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
- Efficiency of automata in semi-commutation verification techniques
- When Does Partial Commutative Closure Preserve Regularity?
- On regular compatibility of semi-commutations
- Some results of Zoltán Ésik on regular languages
This page was built for publication: Regular languages and partial commutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391641)
