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.

Bestandsnummer des Verk�ufers 9783031439728

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Programming-Based Formal Languages and Automata Theory : Design, Implement, Validate, and Prove
Verlag: Springer Nature Switzerland
Erscheinungsjahr: 2023
Sprache: Englisch
ISBN-10: 3031439724
ISBN-13: 9783031439728
Einband: Buch
Zustand: Neu

�ber diesen Titel

Inhaltsangabe

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.

�ber die Autorin bzw. den Autor

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.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Das Unternehmen AHA-BUCH GmbH: Seit der Gr�ndung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisg�nstig wie m�glich ihren B�cherwunsch zu erf�llen. Unsere Firma besch�ftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine W�nsche! Auf �ber 3700 m2 Fl�che haben wir �ber 100.000 B�cher, Modernes Antiquariat und Spiele auf Lager.

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

AHA-BUCH GmbH
Garlebsen 48, Einbeck, 37574, Germany

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

Allgemeine Gesch�ftsbedingungen und Kundeninformationen / Datenschutzerkl�rung

I. Allgemeine Gesch�ftsbedingungen

� 1 Grundlegende Bestimmungen

(1) Die nachstehenden Gesch�ftsbedingungen gelten f�r alle Vertr�ge, die Sie mit uns als Anbieter (AHA-BUCH GmbH) �ber die Internetplattformen AbeBooks und/oder ZVAB schlie�en. Soweit nicht anders vereinbart, wird der Einbeziehung gegebenenfalls von Ihnen verwendeter eigener Bedingungen widersprochen.

(2) Verbraucher im Sinne der nachstehenden Regelungen...

Mehr Information

Versandbedingungen

Wir liefern Lagerartikel innerhalb von 24 Stunden nach Erhalt der Bestellung aus.
Barsortimentsartikel, die wir �ber Nacht geliefert bekommen, am darauffolgenden Werktag.
Unser Ziel ist es Ihnen die Artikel in der �konomischten und effizientesten Weise zu senden.

Impressum & Info zum Verk�ufer