Articles liés à Programming-Based Formal Languages and Automata Theory:...
Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove - Couverture rigide
Synopsis
This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs.
The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Marco T. Morazán is a Full Professor in the Department of Mathematics and Computer Science at Seton Hall University. His main research areas are the implementation of programming languages and computer science education. He developed the FSM (Functional State Machines) programming language, has pioneered an effective computer science curriculum for beginners based on the development of video games, and has turned the automata theory classroom to programming-based activities. Currently he chairs the Steering Committee of the annual Trends in Functional Programming Symposium (TFP), is a Steering Committee Member of the annual Implementation and Application of Functional Languages Symposium (IFL), and is a co-founder of the annual Trends in Functional Programming in Education Workshop.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer International Publishing AG
- Date d'édition2023
- ISBN 10 3031439724
- ISBN 13 9783031439728
- ReliureRelié
- Langueanglais
- Nombre de pages524
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 58,97
Gratuit expédition depuis Etats-Unis vers France
Destinations, frais et délais
Résultats de recherche pour Programming-Based Formal Languages and Automata Theory:...
Image d'archives
Programming-Based Formal Languages and Automata Theory: Design Implement Validate and Prove
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-45701
Quantité disponible : 1 disponible(s)
Image d'archives
Programming-Based Formal Languages and Automata Theory: Design Implement Validate and Prove
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-379867
Quantité disponible : 3 disponible(s)
Image fournie par le vendeur
Programming-Based Formal Languages and Automata Theory
Edité par
Springer Nature Switzerland, 2023
ISBN 10 : 3031439724
ISBN 13 : 9783031439728
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Covers all the mathematical development traditionally employed in computational theory coursesReviews essential mathematical background on sets, relations, formal logic, and reasoning about infinite setsProvides students with the FSM progra. N° de réf. du vendeur 1038610185
Quantité disponible : Plus de 20 disponibles
Image d'archives
Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. 1st ed. 2024 edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26399309023
Quantité disponible : 4 disponible(s)
Image d'archives
Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783031439728_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 398149376
Quantité disponible : 4 disponible(s)
Image d'archives
Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 18399309013
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Programming-Based Formal Languages and Automata Theory : Design, Implement, Validate, and Prove
Edité par
Springer Nature Switzerland, 2023
ISBN 10 : 3031439724
ISBN 13 : 9783031439728
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical. N° de réf. du vendeur 9783031439728
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Programming-Based Formal Languages and Automata Theory
Edité par
Berlin Springer Nature Switzerland Springer Nov 2023, 2023
ISBN 10 : 3031439724
ISBN 13 : 9783031439728
Neuf
Buch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical. 524 pp. Englisch. N° de réf. du vendeur 9783031439728
Quantité disponible : 2 disponible(s)
Image d'archives
Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9783031439728
Quantité disponible : Plus de 20 disponibles