On Parikh slender languages and power series

DOI10.1006/jcss.1996.0014zbMath0846.68056OpenAlexW2010937931MaRDI QIDQ1915514

Juha Honkala

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

zbMATH Keywords

Parikh slender languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

RESULTS CONCERNING THINNESS OF D0L LANGUAGES ⋮ Subword histories and Parikh matrices ⋮ 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 ⋮ A decision method for Parikh slenderness of context-free languages ⋮ Sparse and slender subsets of monoids. ⋮ On Parikh slender context-free languages ⋮ On lengths of words in context-free languages ⋮ A characterization of poly-slender context-free languages ⋮ A sharpening of the Parikh mapping

This page was built for publication: On Parikh slender languages and power series