scientific article; zbMATH DE number 3880130
From MaRDI portal
Publication:3345795
Cited in
(24)- On the Commutative Equivalence of Algebraic Formal Series and Languages
- DNA Computing
- Computational complexity of synchronization under sparse regular constraints
- On bounded linear codes and the commutative equivalence
- Quotient and bounded context-free languages
- scientific article; zbMATH DE number 2013205 (Why is no real title available?)
- There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages
- Recognition of poly-slender context-free languages by trellis automata
- Slender Siromoney matrix languages
- Rational languages and the Burnside problem
- scientific article; zbMATH DE number 4147543 (Why is no real title available?)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- Bounded D0L languages
- On the structure of the counting function of sparse context-free languages.
- On an extension of the class of context-free languages
- The monoids of the patience sorting algorithm
- Periodic and Sturmian languages
- The Parikh counting functions of sparse context-free languages are quasi-polynomials
- On context-free and Szilard languages
- Sparse and slender subsets of monoids.
- On the separability of sparse context-free languages and of bounded rational relations
- A characterization of poly-slender context-free languages
- On the commutative equivalence of bounded context-free and regular languages: the code case
- On the equivalence problem of context-free and DT0L languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3345795)
