Regular languages and partial commutations
From MaRDI portal
Publication:391641
DOI10.1016/J.IC.2013.07.003zbMATH Open1358.68202OpenAlexW2162512015MaRDI QIDQ391641FDOQ391641
Authors: Antonio Cano, Giovanna Guaiana, Jean-Éric Pin 
Publication date: 10 January 2014
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.07.003
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complement reducible graphs
- Semigroups, Presburger formulas, and languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paw-free graphs
- Polynomial closure and unambiguous product
- Semi-commutations
- Title not available (Why is that?)
- Shuffle on positive varieties of languages
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- On total regulators generated by derivation relations
- Polynomial closure of group languages and open sets of the Hall topology
- Efficiency of automata in semi-commutation verification techniques
- When Does Partial Commutative Closure Preserve Regularity?
- Title not available (Why is that?)
- Title not available (Why is that?)
- SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Star Operation for Star-Free Trace Languages
- Star-free star and trace languages
- Bounded Regular Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on the commutative closure of star-free languages
- On hereditary properties of the class of graphs with convex quadratic stability number
- Permutation rewriting and algorithmic verification
Cited In (28)
- POWERS OF REGULAR LANGUAGES
- Relatively regular languages and thin codes
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- State complexity bounds for the commutative closure of group languages
- Title not available (Why is that?)
- Regular binoid expressions and regular binoid languages.
- Title not available (Why is that?)
- Commutative languages and their composition by consensual methods
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
- Overlap-Free Regular Languages
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
- Language theoretic properties of regular DAG languages
- Some results of Zoltán Ésik on regular languages
- Regular languages of nested words: fixed points, automata, and synchronization
- Efficiency of automata in semi-commutation verification techniques
- When Does Partial Commutative Closure Preserve Regularity?
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- Duality and Equational Theory of Regular Languages
- Partial Commutation on Array Languages
- Hairpin Lengthening and Shortening of Regular Languages
- The Shuffle Product: New Research Directions
- A Robust Class of Regular Languages
- On regular compatibility of semi-commutations
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
- The commutative closure of shuffle languages over group languages is regular
- Commutative regular languages with product-form minimal automata
- Geometrically closed positive varieties of languages
- Title not available (Why is that?)
Uses Software
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)
