State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
From MaRDI portal
Publication:6647746
DOI10.1016/J.IC.2024.105204MaRDI QIDQ6647746
Publication date: 3 December 2024
Published in: Information and Computation (Search for Journal in Brave)
shufflefinite automatastate complexityupward closurecommutative regular languageindex and period vector
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular languages and partial commutations
- On a structural property in the state complexity of projected regular languages
- The expressive power of the shuffle product
- On regularity of context-free languages
- On the Burnside problem for semigroups
- Commutative one-counter languages are regular
- State complexity of projection on languages recognized by permutation automata and commuting letters
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- The power of synchronizing operations on strings
- Effective constructions in well-partially-ordered free monoids
- Variétés de langages et opérations
- The state complexities of some basic operations on regular languages
- Modeling literal morphisms by shuffle
- Reset words for commutative and solvable automata
- Commutative regular languages with product-form minimal automata
- Descriptional complexity of formal systems. 23rd IFIP WG 1.02 international conference, DCFS 2021, virtual event, September 5, 2021. Proceedings
- Commutative regular languages -- properties and state complexity
- State complexity of permutation on finite languages over a binary alphabet
- The size of Higman-Haines sets
- Characterizations of locally testable events
- On the State Complexity of the Shuffle of Regular Languages
- Classifying Regular Languages via Cascade Products of Automata
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Linear Automaton Transformations
- An Approach to Computing Downward Closures
- Learning Commutative Regular Languages
- On Shuffle Ideals
- Algebraic Theory of Automata and Languages
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
- JUMPING FINITE AUTOMATA
- On the State Complexity of Scattered Substrings and Superstrings
- On finite monoids having only trivial subgroups
- Commutative Positive Varieties of Languages
- Operational State Complexity under Parikh Equivalence
- Bounded Regular Sets
- On Context-Free Languages
- Permutation automata
- The loop complexity of pure-group events
- On free monoids partially ordered by embedding
- Ordering by Divisibility in Abstract Algebras
- More on the Size of Higman-Haines Sets: Effective Constructions
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
This page was built for publication: State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647746)
