Decision problems concerning thinness and slenderness of formal languages
From MaRDI portal
Publication:1271339
DOI10.1007/S002360050134zbMath0909.68112OpenAlexW2050264307MaRDI 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
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (14)
RESULTS CONCERNING THINNESS OF D0L LANGUAGES ⋮ 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 counting functions and slenderness of languages ⋮ On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ On bounded linear codes and the commutative equivalence ⋮ On the commutative equivalence of bounded context-free and regular languages: the code case ⋮ On injectivity of quantum finite automata ⋮ On the commutative equivalence of bounded context-free and regular languages: the semi-linear case ⋮ On the structure of the counting function of sparse context-free languages. ⋮ Freeness properties of weighted and probabilistic automata over bounded languages ⋮ Acceptance Ambiguity for Quantum Automata ⋮ The Parikh counting functions of sparse context-free languages are quasi-polynomials ⋮ On lengths of words in context-free languages ⋮ A characterization of poly-slender context-free languages
This page was built for publication: Decision problems concerning thinness and slenderness of formal languages
