scientific article; zbMATH DE number 54282

MaRDI QIDQ4000474zbMATH OpenFDO

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

Publication date 23 January 1993

zbMATH Keywords

automatacomplexitycomputabilitydiscrete mathematicsfinite automataformal languagesgraphslogic networksmathematical logicNP-completeness of combinatorial problemsrecursive functionsTuring machines

Mathematics Subject Classification ID

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

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

Cited in

(4)

• Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
• scientific article; zbMATH DE number 3724347 (Why is no real title available?)
• scientific article; zbMATH DE number 1889344 (Why is no real title available?)
• scientific article; zbMATH DE number 914394 (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 Q4000474)