Publication:4168086
From MaRDI portal
zbMath0387.68054MaRDI QIDQ4168086
No author found.
Publication date: 1978
Full work available at URL: https://eudml.org/doc/92076
68Q45: Formal languages and automata
Related Items
Comparisons between some pumping conditions for context-free languages, On languages satisfying “interchange Lemma”, 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, Unnamed Item, Ogden's lemma for nonterminal bounded languages
Cites Work