Products of languages with counter

DOI10.1016/0304-3975(90)90019-EzbMath0704.68071OpenAlexW2036634886MaRDI QIDQ917324

Pascal Weil

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90019-e

zbMATH Keywords

rational languagessyntactic monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Two algebraic approaches to variants of the concatenation product ⋮ Schützenberger-like products in non-free monoids ⋮ Sur le produit avec compteur modulo un nombre premier ⋮ Topologies for the free monoid ⋮ Counting monoids and rational languages ⋮ Algebraic and topological theory of languages ⋮ Theme and Variations on the Concatenation Product ⋮ Closure of varieties of languages under products with counter ⋮ Circuit complexity and the expressive power of generalized first-order formulas ⋮ Languages and formations generated by \(D_4\) and \(Q_8\)

Cites Work

• Families of recognizable sets corresponding to certain varieties of finite monoids
• An application of the matrix representation of transductions
• Locally trivial categories and unambiguous concatenation
• Recognizable sets and power sets of finite semigroups
• Languages of R-trivial monoids
• A generalization of the Schützenberger product of finite monoids
• Classification of finite monoids: the language approach
• Topologies for the free monoid
• Characterizations of locally testable events
• Algebraic decision procedures for local testability
• On finite monoids having only trivial subgroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item