Finite Automation
Loading...
Authors
Subjects
finite automata
finite automaton
deterministic finite automata
DFA
alphabet
strings
empty strings
concatenation
finite automaton
deterministic finite automata
DFA
alphabet
strings
empty strings
concatenation
Advisors
Date of Issue
2005-07-29
Date
Publisher
Language
Abstract
This self-paced narrated tutorial covers the following about Finite Automata: Uses, Examples, Alphabet, strings, concatenation, powers of an alphabet, Languages (automata and formal languages), Deterministic finite automata (DFA)
Type
Interactive Media Element (IME)
Description
tut
present
Tutorial
Presentation
Interactive Media Element
present
Tutorial
Presentation
Interactive Media Element
Series/Report No
Interactive Media Elements (IMEs)
Department
Organization
CED3
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.