scientific article; zbMATH DE number 3870629

zbMATH Open0546.68065MaRDI QIDQ3336724FDOQ3336724

F. Ablayev

Publication date: 1983

Full work available at URL: https://eudml.org/doc/69221

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

Recommendations

• On the complexity of automatic complexity
• scientific article; zbMATH DE number 1502108
• Automaticity. I: Properties of a measure of descriptional complexity
• scientific article; zbMATH DE number 3860398
• Kolmogorov complexity and the Recursion Theorem

zbMATH Keywords

recursive languageseffective enumerationautomata complexityLoveland complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (4)

• SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
• Some Decision Questions Concerning the Time Complexity of Language Acceptors
• 200 Problems on Languages, Automata, and Computation
• Language Recognition Power and Succinctness of Affine Automata

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 Q3336724)