On varieties of rational languages and variable length codes. II
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3854452 (Why is no real title available?)
- scientific article; zbMATH DE number 3827223 (Why is no real title available?)
- scientific article; zbMATH DE number 3898259 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 4037246 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3682031 (Why is no real title available?)
- scientific article; zbMATH DE number 3724720 (Why is no real title available?)
- scientific article; zbMATH DE number 3735171 (Why is no real title available?)
- scientific article; zbMATH DE number 3782404 (Why is no real title available?)
- scientific article; zbMATH DE number 3513711 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 3436628 (Why is no real title available?)
- scientific article; zbMATH DE number 3892608 (Why is no real title available?)
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- Cyclotomic polynomials and unions of groups
- Decomposition and complexity of finite semigroups
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Finite semigroup varieties of the form V*D
- On a question of McNaughton and Papert
- On the syntactic transformation semigroup of a language generated by a finite biprefix code
- On varieties of rational languages and variable-length codes
- Regular semigroups with D=R as syntactic monoids of prefix codes
- Sur le calcul du monoide syntaxique d'un sous monoide finiment engendre
Cited in
(12)- A characterization of rational star languages generated by strong codes
- Some results onC-varieties
- The complexity of intersecting finite automata having few final states
- The power of programs over monoids in DA
- Products of languages with counter
- Inverse semigroups and varieties of finite semigroups
- Closure of varieties of languages under products with counter
- Polynomials, fragments of temporal logic and the variety DA over traces
- scientific article; zbMATH DE number 3972932 (Why is no real title available?)
- On the syntactic transformation semigroup of a language generated by a finite biprefix code
- Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
- Parikh-reducing Church-Rosser representations for some classes of regular languages
This page was built for publication: On varieties of rational languages and variable length codes. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079669)