Subsequence Counting, Matrix Representations and a Theorem of Eilenberg

DOI10.1007/978-3-540-88282-4_3zbMath1156.68465OpenAlexW1819345452MaRDI QIDQ3540092

Benjamin Steinberg

Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_3

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Closure of varieties of languages under products with counter
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• Sur le produit avec compteur modulo un nombre premier

This page was built for publication: Subsequence Counting, Matrix Representations and a Theorem of Eilenberg