Semi-linearity, Parikh-boundedness and tree adjunct languages

DOI10.1016/0020-0190(83)90053-4zbMath0547.68076OpenAlexW2008404821MaRDI QIDQ799121

Aravind K. Joshi, Takashi Yokomori

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90053-4

zbMATH Keywords

Parikh-boundednesssemi-linearityTree adjunct grammarstree adjunct languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Tree adjunct grammars
• On Context-Free Languages
• Chains of full AFL's
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semi-linearity, Parikh-boundedness and tree adjunct languages