On Shuffle Ideals
From MaRDI portal
Publication:4405554
DOI10.1051/ita:2003002zbMath1034.68056OpenAlexW2082846762MaRDI QIDQ4405554
Publication date: 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2002__36_4_359_0
Related Items
On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ On shuffle products, acyclic automata and piecewise-testable languages ⋮ A note on partially ordered tree automata ⋮ Commutative regular languages with product-form minimal automata ⋮ State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizations of some classes of regular events
- Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
- Partially ordered finite monoids and a theorem of I. Simon
- Classification of finite monoids: the language approach
- Classifying regular events in symbolic logic
- Polynomial operations and hierarchies of concatenation
- A natural ring basis for the shuffle algebra and an application to group schemes
- Polynomial closure and unambiguous product
- Shuffle factorization is unique
- Some complexity results for polynomial rational expressions.
- Finite semigroup varieties of the form V*D
- Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
- On the expressive power of temporal logic
- Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy
- A constant time string shuffle algorithm on reconfigurable meshes
- Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: On Shuffle Ideals
