A characterization of context-free languages

DOI10.1016/S0022-0000(71)80023-5zbMath0226.68035OpenAlexW1975470060MaRDI QIDQ2549240

Jozef Gruska

Publication date: 1971

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(71)80023-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (18)

Unnamed Item ⋮ A Kleene-like characterization of languages accepted by systolic tree automata ⋮ Characteristics of graph languages generated by edge replacement ⋮ Balanced-by-Construction Regular and ω-Regular Languages ⋮ Characterizations of regular and context-free matrices ⋮ Inductive inference of context-free languages based on context-free expressions ⋮ Recursive generation of local adjunct languages ⋮ Extended regular expressions of arbitrary star degrees ⋮ Extending regular expressions with homomorphic replacement ⋮ Über eine explizite Darstellung von Listenstrukturen ⋮ Iterating iterated substitution ⋮ A simplified proof of Parikh's theorem ⋮ Classes of formal grammars ⋮ Abstract families of context-free grammars ⋮ ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS ⋮ On a generalization of regular expressions ⋮ Insertion languages ⋮ Kleene modules and linear languages

Cites Work

• Derivation-bounded languages
• Finite-Turn Pushdown Automata
• Inclusion relations among families of context-free languages
• Phrase structure languages, finite machines, and channel capacity
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of context-free languages