|
|
Subject:
Alphabets, strings and languages
Category: Computers > Programming Asked by: camillalog-ga List Price: $2.00 |
Posted:
19 Feb 2004 13:00 PST
Expires: 20 Mar 2004 13:00 PST Question ID: 308521 |
|
Subject:
Re: Alphabets, strings and languages
Answered By: maniac-ga on 05 Mar 2004 05:43 PST |
Hello Camillalog, There is a good summary of finite state machines (finite automata) at: http://en.wikipedia.org/wiki/Finite_state_machine which for the three terms you refer to, I can summarize as follows: Alphabet - generally represented as Sigma, is the set of symbols that are accepted by the FSM. For example, a simple FSM accepting binary numbers would have an alphabet of {0, 1}. String - a sequence of symbols. This is explained in a little more detail at http://en.wikipedia.org/wiki/String#Mathematics The above URL should take you directly to the math related definition. Language - the set of strings that are "accepted" by the FSM. When you define the finite automata, you specify one or more accept states. The string is "accepted" if you are in one of those accept states when the FSM is done processing the string. There are a number of other good references on line. Search using phrases such as alphabet string finite automata alphabet string language FSM and similar phrases. For example http://www.cs.appstate.edu/~dap/classes/2490/chap5.html has a number of good examples. --Maniac |
|
There are no comments at this time. |
If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you. |
Search Google Answers for |
Google Home - Answers FAQ - Terms of Service - Privacy Policy |