Automata Theory
Edit Page
Report
Scan day: 07 February 2014 UTC
18
Virus safety - good
Description: An essay by David Weir.
Automata are abstract mathematical models of machines that perform computations on an input by moving through a series of states or configurations. If the computation of an automaton reaches an accepting configuration it accepts that input. At each stage of the computation, a transition function determines the next configuration on the basis of a finite portion of the present configuration.
Size: 393 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Automata Theory |
| Keywords: | |
| Description: | |
| IP-address: | 198.171.203.122 |
WHOIS Info
| NS | Name Server: NS1.SECURE.NET Name Server: NS2.SECURE.NET |
| WHOIS | Status: clientTransferProhibited |
| Date | Creation Date: 03-dec-1998 Expiration Date: 02-dec-2023 |