On slender context-free languages

DOI10.1007/3-540-59042-0_95MaRDI QIDQ4596643zbMATH OpenOpenAlexFDO

Authors Danny Raz

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_95

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Length considerations in context-free languages
• A decision method for Parikh slenderness of context-free languages
• On lengths of words in context-free languages
• ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
• scientific article; zbMATH DE number 1156871

Cited in

(14)

• On differentiation functions, structure functions, and related languages of context-free grammars
• On Parikh slender context-free languages
• scientific article; zbMATH DE number 1059896 (Why is no real title available?)
• Recognition of poly-slender context-free languages by trellis automata
• Slender Siromoney matrix languages
• Thin and slender languages
• On Parikh slender languages and power series
• On strongly context-free languages
• Recognition of linear-slender context-free languages by real time one-way cellular automata
• Closure properties of slender languages
• Shuffle on trajectories: Syntactic constraints
• On lengths of words in context-free languages
• A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages
• scientific article; zbMATH DE number 1860693 (Why is no real title available?)

This page was built for publication: On slender context-free languages

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