Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/1121

Title: non-deterministic finite automaton
Issue Date: 22-Dec-2006
Publisher: PlanetMath
Citation: http://planetmath.org/encyclopedia/NonDeterministicFiniteAutomaton.html
Abstract: A non-deterministic finite automaton (or NDFA) can be formally defined as a 5-tuple ... , where
URI: http://www.citidel.org/handle/10117/1121
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

There are no files associated with this item.

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback