Closure of varieties of languages under products with counter
- 31 December 1992
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 45 (3) , 316-339
- https://doi.org/10.1016/0022-0000(92)90029-i
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Products of languages with counterTheoretical Computer Science, 1990
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Semigroups and languages of dot-depth twoTheoretical Computer Science, 1988
- Classification of finite monoids: the language approachTheoretical Computer Science, 1981
- A generalization of the Schützenberger product of finite monoidsTheoretical Computer Science, 1981
- Recognizable sets and power sets of finite semigroupsSemigroup Forum, 1979
- Families of recognizable sets corresponding to certain varieties of finite monoidsJournal of Pure and Applied Algebra, 1979
- Aperiodic homomorphisms and the concatenation product of recognizable setsJournal of Pure and Applied Algebra, 1979