scientific article; zbMATH DE number 107969
complexitycomputation theorycontext-free languagesfinite automatarecursive functionsregular languagesTuring machinesundecidability
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20) Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)
- Elements of computation theory
- Introduction to theoretical computer science. Foundations and models
- scientific article; zbMATH DE number 1729953 (Why is no real title available?)
- scientific article; zbMATH DE number 1001667 (Why is no real title available?)
- scientific article; zbMATH DE number 3868585 (Why is no real title available?)
- Introducing the theory of computation
- Introduction to algorithm theory
- scientific article; zbMATH DE number 3902039 (Why is no real title available?)
- scientific article; zbMATH DE number 4058813 (Why is no real title available?)
- scientific article; zbMATH DE number 108371 (Why is no real title available?)
- An Introduction to Formal Languages and Machine Computation
- Automata and computability. A programmer's perspective
- scientific article; zbMATH DE number 3999299 (Why is no real title available?)
- Languages, machines, and classical computation
- Concise guide to computation theory.
- Selected topics on computability, complexity, and termination
- Turing machines. Introduction to the characterization of the complexity of a problem
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 Q4023541)
