Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
From MaRDI portal
Publication:2163995
DOI10.1007/978-3-031-05578-2_13OpenAlexW4285172450MaRDI QIDQ2163995
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_13
finite automataclosure propertiescommutative languagesshuffle closureiterated shuffleregularity-preserving operations
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The expressive power of the shuffle product
- On regularity of context-free languages
- How to prove that a language is regular or star-free?
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- The complexity of logical theories
- Shuffle on positive varieties of languages
- Regularity conditions for iterated shuffle on commutative regular languages
- Commutative regular languages -- properties and state complexity
- Characterization and complexity results on jumping finite automata
- The Shuffle Product: New Research Directions
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Software Descriptions with Flow Expressions
- Algebraic Theory of Automata and Languages
- Commutative Positive Varieties of Languages
- Bounded Regular Sets
This page was built for publication: Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
