scientific article
From MaRDI portal
Publication:3345795
zbMath0552.68062MaRDI QIDQ3345795
Gabriel Thierrin, Michel Latteux
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Rational languages and the Burnside problem, Computational complexity of synchronization under sparse regular constraints, Periodic and Sturmian languages, Recognition of poly-slender context-free languages by trellis automata, On the Commutative Equivalence of Algebraic Formal Series and Languages, Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time, On the equivalence problem of context-free and DT0L languages, On bounded linear codes and the commutative equivalence, The monoids of the patience sorting algorithm, On the commutative equivalence of bounded context-free and regular languages: the code case, Slender Siromoney matrix languages, Sparse and slender subsets of monoids., On the structure of the counting function of sparse context-free languages., On the separability of sparse context-free languages and of bounded rational relations, The Parikh counting functions of sparse context-free languages are quasi-polynomials, A characterization of poly-slender context-free languages
