scientific article; zbMATH DE number 3602696

zbMath0387.68054MaRDI QIDQ4168086

No author found.

Publication date: 1978

Full work available at URL: https://eudml.org/doc/92076

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On languages satisfying “interchange Lemma”, Unnamed Item, Ogden's lemma for nonterminal bounded languages, A note on the sufficiency of Sokolowski's criterion for context-free languages, On satisfying the LL-iteration theorem, The context-freeness of the languages associated with vector addition systems is decidable, Comparisons between some pumping conditions for context-free languages

Cites Work

• A strong pumping lemma for context-free languages
• A note on 1-locally linear languages
• A helpful result for proving inherent ambiguity
• Characterizations and extensions of pushdown translations
• Unnamed Item
• Unnamed Item