Cap expressions for context-free languages

DOI10.1016/S0019-9958(71)90419-0zbMath0221.68042OpenAlexW2050536875MaRDI QIDQ5626294

M. K. Yntema

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/s0019-9958(71)90419-0

Mathematics Subject Classification ID

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

Related Items (8)

Unnamed Item ⋮ Characteristics of graph languages generated by edge replacement ⋮ 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 ⋮ Classes of formal grammars

This page was built for publication: Cap expressions for context-free languages