On bounded rational trace languages
From MaRDI portal
Recommendations
- Rational and recognizable complex trace languages
- scientific article; zbMATH DE number 512855
- A note on the logical definability of rational trace languages
- Logical definability of some rational trace languages
- On regular trace languages
- Publication:4508302
- scientific article; zbMATH DE number 176496
- scientific article; zbMATH DE number 176495
- scientific article; zbMATH DE number 3870628
- scientific article; zbMATH DE number 3848633
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3978418 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1259068 (Why is no real title available?)
- scientific article; zbMATH DE number 2040903 (Why is no real title available?)
- scientific article; zbMATH DE number 4116001 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Interpolated Denumerants and Lambert Series
- On the separability of sparse context-free languages and of bounded rational relations
- On the structure of the counting function of sparse context-free languages.
- Rational sets in commutative monoids
- Sur les rélations rationnelles entre monoides libres
Cited in
(6)- Sparse and slender subsets of monoids.
- On free spectra of finite monoids from the pseudovariety \(\mathsf{DA}\).
- Growth of monomial algebras, simple rings and free subalgebras
- On bounded linear codes and the commutative equivalence
- Theory Is Forever
- scientific article; zbMATH DE number 512855 (Why is no real title available?)
This page was built for publication: On bounded rational trace languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970110)
