On Parikh slender languages and power series
From MaRDI portal
Publication:1915514
DOI10.1006/jcss.1996.0014zbMath0846.68056MaRDI QIDQ1915514
Publication date: 16 July 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0014
68Q45: Formal languages and automata
Related Items
A characterization of poly-slender context-free languages, RESULTS CONCERNING THINNESS OF D0L LANGUAGES, On Parikh slender context-free languages, A decision method for Parikh slenderness of context-free 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 lengths of words in context-free languages, Subword histories and Parikh matrices, Sparse and slender subsets of monoids., A sharpening of the Parikh mapping