Regularity conditions for iterated shuffle on commutative regular languages
From MaRDI portal
Publication:2117658
DOI10.1007/978-3-030-79121-6_3OpenAlexW3174815723MaRDI QIDQ2117658
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2103.09587
finite automataclosure propertiescommutative languagesshuffle closureiterated shuffleregularity-preserving operations
Related Items (2)
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
Cites Work
- Unnamed Item
- 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
- Variétés de langages et opérations
- Shuffle on positive varieties of languages
- Commutative regular languages -- properties and state complexity
- Characterization and complexity results on jumping finite automata
- The Shuffle Product: New Research Directions
- On the Chinese Remainder Theorem
- Software Descriptions with Flow Expressions
- An approach to software system behavior description
- Algebraic Theory of Automata and Languages
- On finite monoids having only trivial subgroups
- Commutative Positive Varieties of Languages
- Bounded Regular Sets
- The loop complexity of pure-group events
This page was built for publication: Regularity conditions for iterated shuffle on commutative regular languages
