A Textbook on Automata Theory

P. K. Srimani; S. F. B. Nasir

doi:10.1017/UPO9788175968363

- Get access
  
  Check if you have access via personal or institutional login
  
  Log in Register
Cited by 3
Cited by
- 3
Crossref Citations

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Bhowmik, Anirban Karforma, Sunil and Dey, Joydeep 2021. Machine Learning Techniques and Analytics for Cloud Security. p. 81.

CrossRef

Google Scholar

Bhowmik, Anirban and Karforma, Sunil 2023. Isomorphic encryption and coupled ANN with Mealy machine: a cutting edge data security model for cloud computing environment. Knowledge and Information Systems, Vol. 65, Issue. 1, p. 133.

CrossRef

Google Scholar

Velasco, Alejandro Palacio, David N. Rodriguez-Cardenas, Daniel and Poshyvanyk, Denys 2024. Which Syntactic Capabilities Are Statistically Learned by Masked Language Models for Code?. p. 72.

CrossRef

Google Scholar

P. K. Srimani, Professor, Department of Computer Science, Bangalore University, S. F. B. Nasir, Professor, Department of Computer Science, Bangalore University

Publisher:: Foundation Books
Online publication date:: October 2011
Print publication year:: 2007
Online ISBN:: 9788175968363
DOI:: https://doi.org/10.1017/UPO9788175968363

Subjects:: Computer Science, Computing: General Interest

Export citation

Information

Contents

Metrics

A Textbook on Automata Theory has been designed for students of computer science. Adopting a comprehensive approach to the subject, the book presents various concepts with adequate explanations. The logical and structured treatment of the subject promotes better understanding and assimilation. Lucid and well-structured presentation makes the book user-friendly. The book cover the curricula for M.C.A., B.E.(Computer Science) and M.Sc. (Computer Science) at various universities and gives students a strong foundation for advanced studies in the field.Key features:- A wide array of solved examples and applications Numerous illustrations supporting theoretical inputs Exercises at the end of each chapter for practice Notation for describing machine models A brief history of mathematicians and computer scientists

- Aa Reduce text
- Aa Enlarge text

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Save to Kindle
Save to Dropbox
Save to Google Drive
Save content to
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to .

To save content items to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Please be advised that item(s) you selected are not available.
You are about to save
Your Kindle email address

Please provide your Kindle email.

@free.kindle.com @kindle.com (service fees apply)

By using this service, you agree that you will only keep content for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services

Metrics

Total number of HTML views: 0

Total number of PDF views: 0 *

Loading metrics...

Total views: 0 *

Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

A Textbook on Automata Theory

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Book description

Refine List

Actions for selected content:

Contents

Frontmatter
pp i-ii

Contents
pp iii-vii

Preface
pp viii-viii

Acknowledgements
pp ix-ix

List of Abbreviations
pp x-x

1 - Fundamentals of Automata
pp 1-33

2 - Formal Language Theory
pp 34-54

3 - Regular Expressions and Languages
pp 55-77

4 - Finite Automata
pp 78-170

5 - Equivalent Automata
pp 171-204

6 - Minimisation/Optimisation of DFA
pp 205-231

7 - Finite Automata and Regular Expressions
pp 232-269

8 - Transducers
pp 270-303

9 - Context-Free Grammars and Context-Free Languages
pp 304-376

10 - Simplification of Context-Free Grammar
pp 377-421

11 - Pushdown Automata
pp 422-456

12 - Pumping Lemma
pp 457-483

13 - Turing Machine
pp 484-543

14 - TM Extensions and Languages
pp 544-562

15 - Formal Languages/Grammar Hierarchy
pp 563-580

Appendix A - Symbol Chart
pp 581-583

Appendix B - Sets, Relations, Functions and Mathematical Induction
pp 584-596

Appendix C - System Modelling
pp 597-600

Index
pp 601-607

Metrics

Full text views

Book summary page views

A Textbook on Automata Theory

Book description

Refine List

Actions for selected content:

Save Search

Contents

Metrics

Full text views

Book summary page views