scientific article; zbMATH DE number 1811326

zbMATH Open0998.03037MaRDI QIDQ3148488FDOQ3148488

Authors: S. S. Marchenkov 

Publication date: 6 October 2002

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

definabilitycomputabilitypredicates on words

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Cited In (2)

• On the polynomial computability of some rudimentary predicates.
• Title not available (Why is that?)

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)