Semi-linearity, Parikh-boundedness and tree adjunct languages

DOI10.1016/0020-0190(83)90053-4MaRDI QIDQ799121zbMATH OpenOpenAlexFDO

Authors Takashi Yokomori, Aravind K. Joshi

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)

Recommendations

• On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
• Bounded Parikh automata
• Bounded Parikh automata
• scientific article; zbMATH DE number 1834688
• On the commutative equivalence of bounded context-free and regular languages: the code case

Cites work

• scientific article; zbMATH DE number 3723892 (Why is no real title available?)
• scientific article; zbMATH DE number 3782403 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Chains of full AFL's
• On Context-Free Languages
• Tree adjunct grammars

Cited in

(3)

• On the degree of nondeterminism of tree adjoining languages and head grammar languages
• The partial clone of linear tree languages
• Semigroups of linear tree languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799121)