| Description |
1 online resource (xiii, 425 pages) : illustrations |
| Bibliography |
Includes bibliographical references (pages 409-416) and index. |
| Contents |
Preliminaries -- Grammars -- Finite State Automata -- Finite State Automata: Characterization, Properties, and Decidability -- Finite State automata with Output and Minimization -- Variants of Finite Automata Pushdown Automata -- Context-Free Grammars -- properties and parsing -- Turing Machine -- Variations of Turing Machines -- Universal Turing Machine and Decidability -- Time and Space Complexity Recent trends and applications -- New Models of Computation. |
| Summary |
Introduction to Formal Languages, Automata Theory and Computation presents the theoretical concepts in a concise and clear manner, with an in-depth coverage of formal grammar and basic automata types. The book also examines the underlying theory and principles of computation and is highly suitable to the undergraduate courses in computer science and information technology. An overview of the recent trends in the field and applications are introduced at the appropriate places to stimulate the interest of active learners. |
| Subject |
Formal languages.
|
|
Computable functions.
|
|
Machine theory.
|
|
Langages formels. |
|
Fonctions calculables. |
|
Théorie des automates. |
|
Formal languages. |
|
Computable functions. |
|
Machine theory. |
|
Computable functions. |
|
Formal languages. |
|
Machine theory. |
|
Mathematics. |
|
Physical Sciences & Mathematics. |
|
Algebra. |
| Added Author |
R., Rama.
|
| Other Form: |
Print version: Krithivasan, Kamala. AIntroduction to formal languages, automata theory and computation. New Delhi, India : Dorling Kindersley (India), ©2009 9788131723562 |
| ISBN |
8131723569 |
|
9788131723562 |
|
More Resources