Publication:3925141

zbMath0471.68002MaRDI QIDQ3925141

Michael A. Arbib, A. J. Kfoury, Robert Moll

Publication date: 1981

zbMATH Keywords

set; theorem proving; graph theory; Boolean algebras; analysis of algorithms; lattices; map; relation; counting trees; context free grammar; formal language theory; recursive definition; switching circuits; reachability problem for automata

Mathematics Subject Classification ID

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68Q45: Formal languages and automata

68R10: Graph theory (including graph drawing) in computer science

68Q65: Abstract data types; algebraic specification

94-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory

68W99: Algorithms in computer science

Related Items

Fluted formulas and the limits of decidability, On randomization and discovery, Uniformly constructive monads