scientific article

From MaRDI portal

Publication:3925141

Jump to:navigation, search

zbMath0471.68002MaRDI QIDQ3925141

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

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Abstract data types; algebraic specification (68Q65) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Algorithms in computer science (68W99)

Related Items (3)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3925141&oldid=17598801"