scientific article; zbMATH DE number 3848633

MaRDI QIDQ3318129zbMATH OpenFDO

Authors Wojciech Rytter

Publication date 1983

zbMATH Keywords

context-free languagesregular languagesrecursively enumerable settrace languagescomplexity of the membership problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• scientific article; zbMATH DE number 3870628
• Membership problems for regular and context-free trace languages
• On regular trace languages
• scientific article; zbMATH DE number 3874641
• Trace languages defined by regular string languages

Cited in

(8)

• On bounded rational trace languages
• On regular trace languages
• scientific article; zbMATH DE number 4065312 (Why is no real title available?)
• Subclasses of recognizable trace languages
• scientific article; zbMATH DE number 1916672 (Why is no real title available?)
• scientific article; zbMATH DE number 4020497 (Why is no real title available?)
• scientific article; zbMATH DE number 3870628 (Why is no real title available?)
• scientific article; zbMATH DE number 3874641 (Why is no real title available?)

This page was built for publication:

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