Shuffle on positive varieties of languages

DOI10.1016/j.tcs.2003.10.034zbMath1143.68431MaRDI QIDQ1884959

Jean-Eric Pin, Antonio Cano Gómez

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.034

zbMATH Keywords

Languages; Finite Automata; Ordered semigroups; Varieties shuffle

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20M35: Semigroups in automata theory, linguistics, etc.

Related Items

On fixed points of the lower set operator, Shuffled languages -- representation and recognition, Regular languages and partial commutations, Upper set monoids and length preserving morphisms, The expressive power of the shuffle product, Positive varieties of tree languages, The Shuffle Product: New Research Directions, Efficiency of automata in semi-commutation verification techniques, A Robust Class of Regular Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local languages and the Berry-Sethi algorithm
• Recognizable sets and power sets of finite semigroups
• Variétés de langages et monoide des parties
• The Birkhoff theorem for finite algebras
• Some results on the generalized star-height problem
• Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
• Variétés de langages et opérations
• Modeling literal morphisms by shuffle
• Algebraic tools for the concatenation product.
• A Reiterman theorem for pseudovarieties of finite first-order structures
• Process Algebra
• SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS
• ORDERED CATEGORIES AND ORDERED SEMIGROUPS
• THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS