On strongly context-free languages

DOI10.1016/S0166-218X(99)00239-5zbMath0958.68084OpenAlexW2004071995MaRDI QIDQ1570831

Arto Salomaa, Lucian Ilie, Gheorghe Păun, Grzegorz Rozenberg

Publication date: 11 July 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00239-5

zbMATH Keywords

context-free languagesstrongly context-free languagesstrongly linear languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems ⋮ The Boolean closure of linear context-free languages ⋮ Kernels of Sub-classes of Context-Free Languages ⋮ Self-Verifying Pushdown and Queue Automata ⋮ Iterative arrays with self-verifying communication cell ⋮ Boolean kernels of context-free languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every iterated morphism yields a co-CFL
• Concise description of finite languages
• On a conjecture about slender context-free languages
• Language-theoretic complexity of disjunctive sequences
• On lengths of words in context-free languages
• Thin and slender languages
• On the index of a context-free grammar and language

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