Uniform characterizations of non-uniform complexity measures

DOI10.1016/S0019-9958(85)80026-7MaRDI QIDQ3716297zbMATH OpenFDO

Authors José L. Balcázar, Joaquim Gabarró, J. Díaz

Publication date 1985

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(85)80026-7

zbMATH Keywords

complexity of formal languagesinitial index of languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3917710
• Nonuniform complexity classes specified by lower and upper bounds
• Asymptotical behaviour of some non-uniform measures
• Instruction sequence based non-uniform complexity classes
• Expressibility and Nonuniform Complexity Classes

Cited in

(10)

• A survey of space complexity
• Unified Characterisations of Resolution Hardness Measures
• scientific article; zbMATH DE number 3917710 (Why is no real title available?)
• Asymptotical behaviour of some non-uniform measures
• Learning finite cover automata from queries
• scientific article; zbMATH DE number 1072527 (Why is no real title available?)
• Instruction sequence based non-uniform complexity classes
• Nonuniform complexity classes specified by lower and upper bounds
• A Unified View on Sequence Complexity Measures as Isometries
• Multi-head two-way finite automata with advice

This page was built for publication: Uniform characterizations of non-uniform complexity measures

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