Please Scroll Down to See Forums Below 
gjohnson5
New member
The purpose of creating automata is to design models on a higher level which will represent essentially scientific flow charts so that a computer can "interpret" language. The lower level is the C code which will actually carry out the automation. The purpose of the C language is that it is fast and is loosely typed, therefore data conversion from one type to another are automatically carried out. But this needs to be used in moderation....
Anyway to the topic of language, In order for a human and a computer to communicate, they must speak the same language. In order to facilitate this, we must create a "definition" of a language. A (finite or infinite) set of strings over a given alphabet is usually called a language. On the smallest level, we call these "regular languages" These are the simplest form of a language such as L = [a-zA-Z]* which denotes any alphabet character in any case and 0 or more occurrences of that character. On the most sophisticated level we have recursive languages which in some cases are probably impossible to model. In order to model the language, we have to at least be able to know if the language is "finite" and at this time, this is an unsolvable question. To demonstrate this, we have what is known as pumping lemma
http://en.wikipedia.org/wiki/Pumping_lemma_for_regular_languages
Which has knowledge of all the characters in the language and is used to diagram all possible combinations of those characters into a greater whole that can be characterized as the language? The purpose of pumping lemma is to disprove that a language is regular. A regular language is a language that may possibly be an infinite combination of sequences from a finite alphabet
http://en.wikipedia.org/wiki/Regular_language
Thus the pumping lemma is an attempt to disprove whether a language is regular
Once the diagram ability of the language is determined, models can be created to thus demonstrate on a higher level how the language can be defined
http://en.wikipedia.org/wiki/Automata_theory
And thus on the lower level implementations can be created by coders such that the human at the higher level and the computer at the lower level can speak the same "jive"
An example of this there needs to be a way of modeling “states” these states determines how the characters or alphabets in the language are combined. There can be one and only one "state" in which these characters can be combined.
http://en.wikipedia.org/wiki/Deterministic_finite_state_machine
There can also be many states in which there are several or many combinations in which states can be combined.
http://en.wikipedia.org/wiki/Nondeterministic_finite_state_machine
Thus models can be created from sets of characters or alphabets where there is one and only one state transition allowed or multiple states in which the automata may transition. Tables or transition tables can be created in order to list the possible combination a state can transition. These are called transition tables or state transition tables
http://en.wikipedia.org/wiki/State_transition_table
Which denote show the states interact with each other and also give clear definition as to how the automata can be diagramed for the particular language?
Thus a language is created such as Basic, ADA , B, C (superset of B) , Pascal, PL/SQL (Superset of ADA) Java (superset of C) Fortran , Cobol or many other examples and these languages are defined scientifically and thus implementation of these languages are created from higher level scientific models. Thus to express how scientific models are utilized to create lower level implementation dependant models, thus:
http://www.cs.rochester.edu/u/leblanc/csc173/fa/re.html
Any questions???
Anyway to the topic of language, In order for a human and a computer to communicate, they must speak the same language. In order to facilitate this, we must create a "definition" of a language. A (finite or infinite) set of strings over a given alphabet is usually called a language. On the smallest level, we call these "regular languages" These are the simplest form of a language such as L = [a-zA-Z]* which denotes any alphabet character in any case and 0 or more occurrences of that character. On the most sophisticated level we have recursive languages which in some cases are probably impossible to model. In order to model the language, we have to at least be able to know if the language is "finite" and at this time, this is an unsolvable question. To demonstrate this, we have what is known as pumping lemma
http://en.wikipedia.org/wiki/Pumping_lemma_for_regular_languages
Which has knowledge of all the characters in the language and is used to diagram all possible combinations of those characters into a greater whole that can be characterized as the language? The purpose of pumping lemma is to disprove that a language is regular. A regular language is a language that may possibly be an infinite combination of sequences from a finite alphabet
http://en.wikipedia.org/wiki/Regular_language
Thus the pumping lemma is an attempt to disprove whether a language is regular
Once the diagram ability of the language is determined, models can be created to thus demonstrate on a higher level how the language can be defined
http://en.wikipedia.org/wiki/Automata_theory
And thus on the lower level implementations can be created by coders such that the human at the higher level and the computer at the lower level can speak the same "jive"
An example of this there needs to be a way of modeling “states” these states determines how the characters or alphabets in the language are combined. There can be one and only one "state" in which these characters can be combined.
http://en.wikipedia.org/wiki/Deterministic_finite_state_machine
There can also be many states in which there are several or many combinations in which states can be combined.
http://en.wikipedia.org/wiki/Nondeterministic_finite_state_machine
Thus models can be created from sets of characters or alphabets where there is one and only one state transition allowed or multiple states in which the automata may transition. Tables or transition tables can be created in order to list the possible combination a state can transition. These are called transition tables or state transition tables
http://en.wikipedia.org/wiki/State_transition_table
Which denote show the states interact with each other and also give clear definition as to how the automata can be diagramed for the particular language?
Thus a language is created such as Basic, ADA , B, C (superset of B) , Pascal, PL/SQL (Superset of ADA) Java (superset of C) Fortran , Cobol or many other examples and these languages are defined scientifically and thus implementation of these languages are created from higher level scientific models. Thus to express how scientific models are utilized to create lower level implementation dependant models, thus:
http://www.cs.rochester.edu/u/leblanc/csc173/fa/re.html
Any questions???
