Embedded Pushdown Automaton - Theory


An EPDA is a finite state machine with a set of stacks that can be themselves accessed through the embedded stack. Each stack contains elements of the stack alphabet, and so we define an element of a stack by, where the star is the Kleene closure of the alphabet.

Each stack can then be defined in terms of its elements, so we denote the th stack in the automaton using a double-dagger symbol:, where would be the next accessible symbol in the stack. The embedded stack of stacks can thus be denoted by .

We define an EPDA by the septuple (7-tuple)

  • is a finite set of states;
  • is the finite set of the input alphabet;
  • is the finite stack alphabet;
  • is the start state;
  • is the set of final states;
  • is the initial stack symbol
  • is the transition function, where are finite subsets of .

Thus the transition function takes a state, the next symbol of the input string, and the top symbol of the current stack and generates the next state, the stacks to be pushed and popped onto the embedded stack, the pushing and popping of the current stack, and the stacks to be considered the current stacks in the next transition. More conceptually, the embedded stack is pushed and popped, the current stack is optionally pushed back onto the embedded stack, and any other stacks one would like are pushed on top of that, with the last stack being the one read from in the next iteration. Therefore, stacks can be pushed both above and below the current stack.

A given configuration is defined by

where is the current state, the s are the stacks in the embedded stack, with the current stack, and for an input string, is the portion of the string already processed by the machine and is the portion to be processed, with its head being the current symbol read. Note that the empty string is implicitly defined as a terminating symbol, where if the machine is at a final state when the empty string is read, the entire input string is accepted, and if not it is rejected. Such accepted strings are elements of the language

where and defines the transition function applied over as many times as necessary to parse the string.

Read more about this topic:  Embedded Pushdown Automaton

Other articles related to "theory":

Feudalism - Etymology
... The most widely held theory is put forth by Marc Bloch ... This Germanic origin theory was also shared by William Stubbs in the nineteenth century ... Another theory was put forward by Archibald R ...
J. Philippe Rushton - Work and Opinions - Application of r/K Selection Theory To Race
... Rushton's book Race, Evolution, and Behavior (1995) uses r/K selection theory to explain how East Asians consistently average high, blacks low, and whites in the middle on an evolutionary scale of characteristics ... He first published this theory in 1984 ... He theorizes that r/K selection theory explains these differences ...
Falsifiability - The Criterion of Demarcation
... It is useful to know if a statement or theory is falsifiable, if for no other reason than that it provides us with an understanding of the ways in which one might assess the ... least be saved from attempting to falsify a non-falsifiable theory, or come to see an unfalsifiable theory as unsupportable ... Popper claimed that, if a theory is falsifiable, then it is scientific ...
Zermelo Set Theory
... Zermelo set theory, as set out in an important paper in 1908 by Ernst Zermelo, is the ancestor of modern set theory ...
... Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a ... Originally formulated for two-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has ...

Famous quotes containing the word theory:

    The great tragedy of science—the slaying of a beautiful theory by an ugly fact.
    Thomas Henry Huxley (1825–1895)

    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)

    In the theory of gender I began from zero. There is no masculine power or privilege I did not covet. But slowly, step by step, decade by decade, I was forced to acknowledge that even a woman of abnormal will cannot escape her hormonal identity.
    Camille Paglia (b. 1947)