By Topic

Finite Automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31.0 $31.0
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

This chapter contains sections titled:
Introduction
Deterministic Finite Automata
Converting a DFA to a Regular Expression
Java Code for a DFA
Nondeterministic Finite Automata
Using an NFA as an Algorithm
Converting an NFA to a DFA with the Subset Algorithm
Converting a DFA to a Regular Grammar
Converting a Regular Grammar to an NFA
Converting a Regular Expression to an NFA
Finding the Minimal DFA
Pumping Property of Regular Languages
Problems