Semi-linearity, Parikh-boundedness and tree adjunct languages

DOI10.1016/0020-0190(83)90053-4zbMATH Open0547.68076OpenAlexW2008404821MaRDI QIDQ799121FDOQ799121

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

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

zbMATH Keywords

Parikh-boundednesssemi-linearityTree adjunct grammarstree adjunct languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• On Context-Free Languages
• Title not available (Why is that?)
• Tree adjunct grammars
• Chains of full AFL's
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Semigroups of linear tree languages
• On the degree of nondeterminism of tree adjoining languages and head grammar languages
• The partial clone 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)