Regularity conditions for iterated shuffle on commutative regular languages
From MaRDI portal
Publication:2117658
DOI10.1007/978-3-030-79121-6_3OpenAlexW3174815723MaRDI QIDQ2117658FDOQ2117658
Authors: Stefan Hoffmann 
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2103.09587
Recommendations
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
- On the itarated shuffle of some regular languages
- scientific article; zbMATH DE number 1222104
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
- Shuffle product of regular languages: results and open problems
- On the enlargement of the class of regular languages by the shuffle closure
- Shuffle decomposition of regular languages
- On the State Complexity of the Shuffle of Regular Languages
finite automataclosure propertiescommutative languagesshuffle closureiterated shuffleregularity-preserving operations
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?)
- On finite monoids having only trivial subgroups
- Title not available (Why is that?)
- Shuffle on positive varieties of languages
- Software Descriptions with Flow Expressions
- An approach to software system behavior description
- The expressive power of the shuffle product
- Algebraic Theory of Automata and Languages
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- Commutative regular languages -- properties and state complexity
- Bounded Regular Sets
- Variétés de langages et opérations
- On regularity of context-free languages
- Title not available (Why is that?)
- The Shuffle Product: New Research Directions
- The loop complexity of pure-group events
- How to prove that a language is regular or star-free?
- On the Chinese Remainder Theorem
- Characterization and complexity results on jumping finite automata
- On the shuffle of star-free languages
- Title not available (Why is that?)
- Commutative Positive Varieties of Languages
Cited In (3)
This page was built for publication: Regularity conditions for iterated shuffle on commutative regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117658)
