Inclusion relations among families of context-free languages

DOI10.1016/S0019-9958(67)91032-7zbMath0207.31405OpenAlexW2065290848MaRDI QIDQ5608021

M. K. Yntema

Publication date: 1967

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(67)91032-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Algebraic program analysis ⋮ Chains of full AFL's ⋮ Unnamed Item ⋮ Convergence of Newton's method over commutative semirings ⋮ Newton’s Method for ω-Continuous Semirings ⋮ Extended regular expressions of arbitrary star degrees ⋮ One counter languages and the IRS condition ⋮ Uniformly erasable AFL ⋮ Context-free grammar forms ⋮ Derivation-bounded languages ⋮ Syntactic operators on full semiAFLs ⋮ A characterization of context-free languages ⋮ Sur la rationalite de certaines séries generatrices ⋮ Langages à un compteur ⋮ Theory of formal grammars