Products of languages with counter

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

Pascal Weil

Publication date: 1990

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

zbMATH Keywords

rational languages; syntactic monoid

Mathematics Subject Classification ID

68Q45: Formal languages and automata

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

Related Items

Algebraic and topological theory of languages, Schützenberger-like products in non-free monoids, Two algebraic approaches to variants of the concatenation product, Topologies for the free monoid, Counting monoids and rational languages, Closure of varieties of languages under products with counter, Theme and Variations on the Concatenation Product, Sur le produit avec compteur modulo un nombre premier

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