Lectures on computer science. Vol. 3: Computability, formal languages, specifications

MaRDI QIDQ1360183zbMATH OpenFDO

Authors Gerhard Goos

Publication date 16 July 1997

Published in Springer-Lehrbuch (Search for Journal in Brave)

zbMATH Keywords

complexityspecificationcomputabilityNP completeness

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 3909745
• scientific article; zbMATH DE number 43003
• scientific article; zbMATH DE number 1729953
• An Introduction to Formal Languages and Machine Computation
• Lectures on computer science. Vol. 1: Foundations and functional programming
• Lectures on computer science. Vol. 1: Foundations and functional programming
• scientific article; zbMATH DE number 1178947
• Logic(s), formal languages and complexity for computer science
• Introduction to theoretical computer science. Formal languages and automata.

Cited in

(1)

• Lectures on computer science. Vol. 1: Foundations and functional programming

This page was built for publication: Lectures on computer science. Vol. 3: Computability, formal languages, specifications

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