Theme and Variations on the Concatenation Product

DOI10.1007/978-3-642-21493-6_3zbMath1307.68052OpenAlexW203478698MaRDI QIDQ3014930

Jean-Eric Pin

Publication date: 8 July 2011

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21493-6_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Related Items

The Shuffle Product: New Research Directions ⋮ Unnamed Item

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
• Unnamed Item
• Unnamed Item
• Families of recognizable sets corresponding to certain varieties of finite monoids
• A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages
• Finite-automaton aperiodicity is PSPACE-complete
• Two algebraic approaches to variants of the concatenation product
• Products of languages with counter
• An application of the matrix representation of transductions
• Characterizations of some classes of regular events
• First-order logic and star-free sets
• A property of the Schützenberger product
• Locally trivial categories and unambiguous concatenation
• Semigroups and languages of dot-depth two
• Languages of R-trivial monoids
• A generalization of the Schützenberger product of finite monoids
• Classification of finite monoids: the language approach
• The Birkhoff theorem for finite algebras
• Classifying regular events in symbolic logic
• Topologies for the free monoid
• Polynomial operations and hierarchies of concatenation
• Closure of varieties of languages under products with counter
• The dot-depth hierarchy of star-free languages is infinite
• Polynomial closure of group languages and open sets of the Hall topology
• Polynomial closure and unambiguous product
• Logic, semigroups and automata on words
• Sur les monoides dont tous les groupes sont resolubles
• Algebraic tools for the concatenation product.
• A Reiterman theorem for pseudovarieties of finite first-order structures
• Profinite semigroups, Mal'cev products, and identities
• Finite semigroup varieties of the form V*D
• Deterministic concatenation product of languages recognized by finite idempotent monoids.
• Languages of dot-depth 3/2
• Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
• Varieties of finite supersolvable groups with the M.~Hall property.
• Dot-depth of star-free events
• A conjecture on the concatenation product
• Duality and Equational Theory of Regular Languages
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• Equations Defining the Polynomial Closure of a Lattice of Regular Languages
• Sur le produit avec compteur modulo un nombre premier
• The Kernel Category and Variants of the Concatenation Product
• Some results onC-varieties
• POLYNOMIAL CLOSURE AND TOPOLOGY
• THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
• On finite monoids having only trivial subgroups
• Profinite Methods in Automata Theory
• A Note on Star-Free Events

This page was built for publication: Theme and Variations on the Concatenation Product