A decision method for Parikh slenderness of context-free languages

DOI10.1016/S0166-218X(96)00023-6MaRDI QIDQ674912zbMATH OpenFDO

Authors Juha Honkala

Publication date 30 June 1997

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

context-free languageParikh slender languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On Parikh slender context-free languages
• On Parikh slender languages and power series
• ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
• scientific article; zbMATH DE number 1543062
• On slender context-free languages

Cites work

• Analytic models and ambiguity of context-free languages
• Closure properties of slender languages
• scientific article; zbMATH DE number 58306 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 1995145 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Language-theoretic problems arising from Richelieu cryptosystems
• Length considerations in context-free languages
• On a conjecture about slender context-free languages
• On Parikh slender languages and power series
• Prefixes of infinite words and ambiguous context-free languages
• Slender 0L languages
• Thin and slender languages

Cited in

(10)

• The Parikh counting functions of sparse context-free languages are quasi-polynomials
• A note on Parikh maps, abstract languages, and decision problems
• On lengths of words in context-free languages
• Min of Mat is not necessarily Mat
• On bounded linear codes and the commutative equivalence
• scientific article; zbMATH DE number 1543062 (Why is no real title available?)
• On slender context-free languages
• On the commutative equivalence of bounded context-free and regular languages: the code case
• ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
• On Parikh slender context-free languages

This page was built for publication: A decision method for Parikh slenderness of context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674912)