Algebraic tools for the concatenation product.

DOI10.1016/S0304-3975(01)00230-4zbMath1064.68057MaRDI QIDQ1853747

Jean-Eric Pin

Publication date: 22 January 2003

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

zbMATH Keywords

Finite automataConcatenationRecognizable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (11)

Shuffle on positive varieties of languages ⋮ Two algebraic approaches to variants of the concatenation product ⋮ The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies ⋮ A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS ⋮ Theme and Variations on the Concatenation Product ⋮ Some results onC-varieties ⋮ Schützenberger Products in a Category ⋮ SUBHIERARCHIES OF THE SECOND LEVEL IN THE STRAUBING–THÉRIEN HIERARCHY ⋮ Constructing divisions into power groups ⋮ Characterizing level one in group-based concatenation hierarchies ⋮ A conjecture on the concatenation product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of recognizable sets corresponding to certain varieties of finite monoids
• A property of the Schützenberger product
• Semigroups and languages of dot-depth two
• A generalization of the Schützenberger product of finite monoids
• Classification of finite monoids: the language approach
• Classifying regular events in symbolic logic
• Polynomial operations and hierarchies of concatenation
• On a conjecture concerning dot-depth two languages
• Closure of varieties of languages under products with counter
• Some results on the dot-depth hierarchy
• Aperiodic homomorphisms and the concatenation product of recognizable sets
• Polynomial closure of group languages and open sets of the Hall topology
• Polynomial closure and unambiguous product
• Logic, semigroups and automata on words
• Free profinite semigroups over semidirect products
• Eilenberg's theorem for positive varieties of languages
• A Reiterman theorem for pseudovarieties of finite first-order structures
• Finite semigroup varieties of the form V*D
• On the Decidability of Iterated Semidirect Products with Applications to Complexity
• SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS
• The product of rational languages
• POLYNOMIAL CLOSURE AND TOPOLOGY
• ORDERED CATEGORIES AND ORDERED SEMIGROUPS
• THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
• On finite monoids having only trivial subgroups

This page was built for publication: Algebraic tools for the concatenation product.