scientific article; zbMATH DE number 54282

zbMATH Open0788.00004MaRDI QIDQ4000474FDOQ4000474

Authors: O. P. Kuznetsov, George M. Adelson-Velsky 

Publication date: 23 January 1993

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

Recommendations

• scientific article; zbMATH DE number 3724347
• scientific article; zbMATH DE number 195036
• Elements of discrete mathematics
• scientific article; zbMATH DE number 50278
• scientific article; zbMATH DE number 976933
• scientific article; zbMATH DE number 1868631
• scientific article; zbMATH DE number 430499
• Discrete mathematics
• scientific article; zbMATH DE number 2118879
• scientific article; zbMATH DE number 789390

zbMATH Keywords

graphscomplexitydiscrete mathematicsautomatafinite automataformal languagescomputabilityTuring machinesrecursive functionsmathematical logiclogic networksNP-completeness of combinatorial problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Classical propositional logic (03B05) Automata and formal grammars in connection with logical questions (03D05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematics in general (00-01) Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite approximatization of languages for representation of system properties: Axiomatization of dependencies

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