String adjunct grammars: II. Equational representation, null symbols, and linguistic relevance

DOI10.1016/S0019-9958(72)80005-6zbMath0245.68028DBLPjournals/iandc/JoshiKY72OpenAlexW2023359431WikidataQ56339011 ScholiaQ56339011MaRDI QIDQ5657673

S. Rao Kosaraju, H. M. Yamada, Aravind K. Joshi

Publication date: 1972

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

Full work available at URL: https://doi.org/10.1016/s0019-9958(72)80005-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Recursive generation of local adjunct languages ⋮ Tree adjunct grammars ⋮ Classes of formal grammars

This page was built for publication: String adjunct grammars: II. Equational representation, null symbols, and linguistic relevance