Theory
We define a queue machine by the six-tuple
- where
- is a finite set of states;
- is the finite set of the input alphabet;
- is the finite queue alphabet;
- is the initial queue symbol;
- is the start state;
- is the transition function.
We define the current status of the machine by a configuration, an ordered pair of its state and queue contents (note defines the Kleene closure or set of all supersets of ). Therefore the starting configuration on an input string is defined as, and we can define our transition as the function that, given an initial state and queue, takes the function to a new state and queue. Note the "first-in-first-out" property of the queue in the relation
where defines the next configuration relation, or simply the transition function from one configuration to the next.
The machine accepts a string if after a (possibly infinite) number of transitions the starting configuration evolves to exhaust the string (reaching a null string ), or
Read more about this topic: Queue Automaton
Famous quotes containing the word theory:
“No theory is good unless it permits, not rest, but the greatest work. No theory is good except on condition that one use it to go on beyond.”
—André Gide (1869–1951)
“No one thinks anything silly is suitable when they are an adolescent. Such an enormous share of their own behavior is silly that they lose all proper perspective on silliness, like a baker who is nauseated by the sight of his own eclairs. This provides another good argument for the emerging theory that the best use of cryogenics is to freeze all human beings when they are between the ages of twelve and nineteen.”
—Anna Quindlen (20th century)
“The theory of rights enables us to rise and overthrow obstacles, but not to found a strong and lasting accord between all the elements which compose the nation.”
—Giuseppe Mazzini (1805–1872)