MetadataShow full item record
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)
tutpresentTutorialPresentationInteractive Media Element
Showing items related by title, author, creator and subject.
MacLennan, Bruce J. (Monterey, California. Naval Postgraduate School, 1986-11); NPS52-86-023Relational programming is a style of programming in which entire relations are manipulated as data and in which programs are also considered relations. Extensive use is made of higher-order, finite and infinite relations ...
Laboo, Brett N. (Monterey, California. Naval Postgraduate School, 2007-06);This thesis produces models of satellite constellations using finite state automata (FSA) or finite automata (FA) and optimizes the sequence of targets for two missions. Two simplified FSA models of satellite constellations ...
Williams, James R. (Monterey, California: Naval Postgraduate School, 2014-06);MANA (Map Aware, Non-uniform, Automata) is an agent-based, time-stepped, stochastic mission-level modeling environment developed by the New Zealand Defense Technology Agency (DTA). While the MANA user manual goes into ...