A Study on push-down automata

DOI: https://doi.org/10.70593/978-93-49910-92-8_6

Authors

Soumodip Kumar Paul
Department of Mathematics, Chandigarh University, Punjab, India
Babul Sarkar
Department of Mathematics, Chandigarh University, Punjab, India

Synopsis

This chapter explores the concept, structure and applications of Push-Down Automata (PDA), a theoretical model used to recognize context-free languages (CFLs). The chapter provides a detailed introduction to PDA, their historical background and various terminologies related to PDAs including their acceptance. Furthermore, the chapter highlights the role of PDAs across various important domains. By bridging theory and practical applications, PDAs remain a critical component in fields like programming languages and formal verification, showcasing their relevance in both academic research and industry practices.
Keywords: Automata Theory, Context-Free Grammar, Formal Languages, Push-Down Automata.

Downloads

Chapter 6

Volume

Theory of Automata and Its Applications in Science and Engineering

Pages

83-90

Published

6 May 2025
Copyright (c) 2025 Sunil Kumar; Soumodip Kumar Paul, Tarun Kumar Gupta, Nandini Rao, Miss Daisy; Ashish Kumar; Kanika, Himpriya Kumari; Virendra Nath Pathak, Sudhanshu Shekhar Dubey, Jitendra Kumar; Babul Sarkar

How to Cite

Paul, S. K. ., & Sarkar, B. . (2025). A Study on push-down automata. In S. . Kumar, V. N. . Pathak, S. S. . Dubey, & J. Kumar (Eds.), & A. . Kumar, Theory of Automata and Its Applications in Science and Engineering (pp. 83-90). Deep Science Publishing. https://doi.org/10.70593/978-93-49910-92-8_6
Download Citation