Decision problems concerning thinness and slenderness of formal languages
From MaRDI portal
Publication:1271339
DOI10.1007/s002360050134zbMath0909.68112MaRDI QIDQ1271339
Publication date: 11 January 1999
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050134
68Q45: Formal languages and automata
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
A characterization of poly-slender context-free languages, RESULTS CONCERNING THINNESS OF D0L LANGUAGES, On the commutative equivalence of bounded context-free and regular languages: the code case, The Parikh counting functions of sparse context-free languages are quasi-polynomials, Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508, On lengths of words in context-free languages, On bounded linear codes and the commutative equivalence, On injectivity of quantum finite automata, On the commutative equivalence of bounded context-free and regular languages: the semi-linear case, Freeness properties of weighted and probabilistic automata over bounded languages, On counting functions and slenderness of languages, On the structure of the counting function of sparse context-free languages.
