scientific article; zbMATH DE number 1811326

MaRDI QIDQ3148488zbMATH OpenFDO

Authors S. S. Marchenkov

Publication date 6 October 2002

zbMATH Keywords

computabilitydefinabilitypredicates on words

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Recommendations

• scientific article; zbMATH DE number 3961590
• scientific article; zbMATH DE number 4174914
• On the complexity of computation of rudimentary predicates
• On the polynomial computability of some rudimentary predicates.
• The expressibility of languages and relations by word equations

Cited in

(2)

• On the polynomial computability of some rudimentary predicates.
• scientific article; zbMATH DE number 3961590 (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 Q3148488)