× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.


  • Subject: Re[2]: Techniques for variable field types in a subfile
  • From: "Eric N. Wilson" <doulos1@xxxxxxxx>
  • Date: Fri, 11 Aug 2000 09:14:52 -0700
  • Organization: Doulos Software & Computer Services

Hello david.vann,

Friday, August 11, 2000, 12:59:30 AM, you wrote:

> What's a finite state machine?

> Cheers  -  Ignoramus

First of all the only dumb question is the question that is not asked.
Some people on this list may be rude and shoot people down but that is
not the case with everyone. A finite state machine is a computer
science term for which the below definition may help. There are a
great many books that talk about these and I know that Knuth's "The
Art of Computer Programming" is one of them (I believe book
1-Fundamental Algorithms).

finite state machine
(definition) 

Definition: An abstract computer consisting of a set of states, a
start state, an  input alphabet, and a transition function which maps
input symbols and current states to a next state. The computer begins
in the start state with an input string. It changes to new states
determined the transition function. There are many variants, for
instance, machines having actions (outputs) associated transitions
(Mealy machine) or states (Moore machine), multiple start states,
transitions conditioned on no input symbol (a null) or more than one
transition for a given symbol and state (nondeterministic finite state
machine), one or more states designated as accepting states
(recognizer), etc. Also known as a finite state automaton.

See also deterministic finite state machine, Kripke structure,
transducer,  Markov chain, hidden Markov model.

Note: Equivalent to a restricted Turing machine where the head is
read-only and shifts only from left to right. (After Algorithms and
Theory of Computation Handbook, page 24-19.)

This quote was lifted from 
http://hissa.nist.gov/dads/HTML/finiteStateMachine.html


----------------------------------
Eric N. Wilson
President
Doulos Software and Computer Services


+---
| This is the RPG/400 Mailing List!
| To submit a new message, send your mail to RPG400-L@midrange.com.
| To subscribe to this list send email to RPG400-L-SUB@midrange.com.
| To unsubscribe from this list send email to RPG400-L-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator: david@midrange.com
+---

As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.