Title Details: | |
Computation Theory and Applications |
|
Authors: |
Katsaros, Panagiotis |
Reviewer: |
Stamelos, Ioannis |
Subject: | MATHEMATICS AND COMPUTER SCIENCE > > |
Keywords: |
Languages
Automata Grammars Computability Computational Complexity |
Description: | |
Abstract: |
Computation Theory was developed to study fundamental questions about the concept of computation and the capabilities of our computing machines. Computation is a physical phenomenon, performed on a closed system we call a computer. Which calculations are feasible and which calculations are impossible? How can we know whether a given problem can be solved and whether it can be done sufficiently quickly? To answer these questions, scientists have been inspired by abstract models of computation, such as recursive functions, calculus-l, Turing machines, and finite-state machines. The definition of computational models is characterized by a mathematical rigor necessary to prove results that answer the questions posed. The Turing machine, a theoretical machine model proposed by Alan Turing in 1936, has proved to be the most expressive model to date, as it can represent any computation of a computing machine. Finite-state machines combine the simplicity of computation representation with significant computational expressive capabilities and therefore have many applications in the design and analysis of the behavior of systems such as vending machines, computer games, CPUs and other applications such as text analysis, network protocol analysis and natural language processing. Various extensions of computational models such as those mentioned above also find application in the study of biological systems and embedded systems that interact with the environment in real time. The e-book "Computation Theory and Applications" is an original presentation of the basic results of Computation Theory interspersed with numerous applications from various fields, simulations, evaluation criteria, and extensive multimedia and interactive content.
|
Linguistic Editors: |
Pappas, Vasilios |
Technical Editors: |
Stachtiari, Emmanouela |
Graphic Editors: |
Katsaros, Panagiotis |
Type: |
Undergraduate textbook |
Creation Date: | 2015 |
Item Details: | |
ISBN |
978-960-603-406-0 |
License: |
Attribution – NonCommercial – NoDerivatives 4.0 International (CC BY-NC-ND 4.0) |
DOI | http://dx.doi.org/10.57713/kallipos-478 |
Handle | http://hdl.handle.net/11419/5744 |
Bibliographic Reference: | Katsaros, P. (2015). Computation Theory and Applications [Undergraduate textbook]. Kallipos, Open Academic Editions. https://dx.doi.org/10.57713/kallipos-478 |
Language: |
Greek |
Consists of: |
1. Languages and Computing 2. Regular Languages and Finite Automata 3. Minimization and Non Regular Languages 4. Context Free Languages and Grammars 5. Stacked Automata and- non Context Free Languages 6. Turing Machines 7. Solvability and Non-solvability 8. Computable Functions 9. Computational Compexity 10. NP- completeness |
Number of pages |
308 |
Publication Origin: |
Kallipos, Open Academic Editions |
You can also view | |
User comments | |
There are no published comments available! | |