<--- Back to Details
First PageDocument Content
Computing / Nondeterministic finite automaton / Lexical analysis / Powerset construction / Deterministic finite automaton / Regular expression / Finite-state machine / Formal language / Regular language / Automata theory / Programming language implementation / Theoretical computer science
Date: 2008-09-08 16:58:22
Computing
Nondeterministic finite automaton
Lexical analysis
Powerset construction
Deterministic finite automaton
Regular expression
Finite-state machine
Formal language
Regular language
Automata theory
Programming language implementation
Theoretical computer science

Microsoft Word - 03-Lexical-Analysis.doc

Add to Reading List

Source URL: dragonbook.stanford.edu

Download Document from Source Website

File Size: 177,44 KB

Share Document on Facebook

Similar Documents

Mathematical Foundations of Automata Theory ´ Jean-Eric Pin Version of June 15, 2018

DocID: 1uKeS - View Document

CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Lecture 15 Andrej Bogdanov

DocID: 1uDy7 - View Document

Theory Comput Syst DOIs00224Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization Marcelo Arenas · Pablo Barceló · Leonid Libkin

DocID: 1tED6 - View Document

Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata

DocID: 1tDnH - View Document

University of Warsaw Faculty of Mathematics, Informatics, and Mechanics Michał Skrzypczak Descriptive set theoretic methods in automata theory

DocID: 1sU9J - View Document