Embedded pushdown automaton

EPDAs were first described by K. Vijay-Shanker in his 1988 doctoral thesis.[1] They have since been applied to more complete descriptions of classes of mildly context-sensitive grammars and have had important roles in refining the Chomsky hierarchy. Various subgrammars, such as the linear indexed grammar, can thus be defined.[2]

While natural languages have traditionally been analyzed using context-free grammars (see transformational-generative grammar and computational linguistics), this model does not work well for languages with crossed dependencies, such as Dutch, situations for which an EPDA is well suited. A detailed linguistic analysis is available in Joshi, Schabes (1997).[3]

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 ${\displaystyle \,\Gamma }$, and so we define an element of a stack by ${\displaystyle \,\sigma _{i}\in \Gamma ^{*}}$, 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 ${\displaystyle \,j}$th stack in the automaton using a double-dagger symbol: ${\displaystyle \,\Upsilon _{j}=\ddagger \sigma _{j}=\{\sigma _{j,k},\sigma _{j,k-1},\ldots ,\sigma _{j,1}\}}$, where ${\displaystyle \,\sigma _{j,k}}$ would be the next accessible symbol in the stack. The embedded stack of ${\displaystyle \,m}$ stacks can thus be denoted by ${\displaystyle \,\{\Upsilon _{j}\}=\{\ddagger \sigma _{m},\ddagger \sigma _{m-1},\ldots ,\ddagger \sigma _{1}\}\in (\ddagger \Gamma ^{+})^{*}}$.

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

${\displaystyle \,M=(Q,\Sigma ,\Gamma ,\delta ,q_{0},Q_{\textrm {F}},\sigma _{0})}$ where

• ${\displaystyle \,Q}$ is a finite set of states;
• ${\displaystyle \,\Sigma }$ is the finite set of the input alphabet;
• ${\displaystyle \,\Gamma }$ is the finite stack alphabet;
• ${\displaystyle \,q_{0}\in Q}$ is the start state;
• ${\displaystyle \,Q_{\textrm {F}}\subseteq Q}$ is the set of final states;
• ${\displaystyle \,\sigma _{0}\in \Gamma }$ is the initial stack symbol
• ${\displaystyle \,\delta :Q\times \Sigma \times \Gamma \rightarrow S}$ is the transition function, where ${\displaystyle \,S}$ are finite subsets of ${\displaystyle \,Q\times (\ddagger \Gamma ^{+})^{*}\times \Gamma ^{*}\times (\ddagger \Gamma ^{+})^{*}}$.

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

${\displaystyle \,C(M)=\{q,\Upsilon _{m}\ldots \Upsilon _{1},x_{1},x_{2}\}\in Q\times (\ddagger \Gamma ^{+})^{*}\times \Sigma ^{*}\times \Sigma ^{*}}$

where ${\displaystyle \,q}$ is the current state, the ${\displaystyle \,\Upsilon }$s are the stacks in the embedded stack, with ${\displaystyle \,\Upsilon _{m}}$ the current stack, and for an input string ${\displaystyle \,x=x_{1}x_{2}\in \Sigma ^{*}}$, ${\displaystyle \,x_{1}}$ is the portion of the string already processed by the machine and ${\displaystyle \,x_{2}}$ is the portion to be processed, with its head being the current symbol read. Note that the empty string ${\displaystyle \,\epsilon \in \Sigma }$ 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

${\displaystyle \,L(M)=\left\{x|\{q_{0},\Upsilon _{0},\epsilon ,x\}\rightarrow _{M}^{*}\{q_{\textrm {F}},\Upsilon _{m}\ldots \Upsilon _{1},x,\epsilon \}\right\}}$

where ${\displaystyle \,q_{\textrm {F}}\in Q_{\textrm {F}}}$ and ${\displaystyle \,\rightarrow _{M}^{*}}$ defines the transition function applied over as many times as necessary to parse the string.

An informal description of EPDA can also be found in Joshi, Schabes (1997),[3] Sect.7, p. 23-25.

A more precisely defined hierarchy of languages that correspond to the mildly context-sensitive class was defined by David J. Weir.[4] Based on the work of Nabil A. Khabbaz,[5][6] Weir's Control Language Hierarchy is a containment hierarchy of countable set of language classes where the Level-1 is defined as context-free, and Level-2 is the class of tree-adjoining and the other three grammars.

Following are some of the properties of Level-k languages in the hierarchy:

• Level-k languages are properly contained in the Level-(k + 1) language class
• Level-k languages can be parsed in ${\displaystyle O(n^{3\cdot 2^{k-1}})}$ time
• Level-k contains the language ${\displaystyle \{a_{1}^{n}\dotso a_{2^{k}}^{n}|n\geq 0\}}$, but not ${\displaystyle \{a_{1}^{n}\dotso a_{2^{k+1}}^{n}|n\geq 0\}}$
• Level-k contains the language ${\displaystyle \{w^{2^{k-1}}|w\in \{a,b\}^{*}\}}$, but not ${\displaystyle \{w^{2^{k-1}+1}|w\in \{a,b\}^{*}\}}$

Those properties correspond well (at least for small k > 1) to the conditions of mildly context-sensitive languages imposed by Joshi, and as k gets bigger, the language class becomes, in a sense, less mildly context-sensitive.

• combinatory categorial grammar

• Laura Kallmeyer (2010). Parsing Beyond Context-Free Grammars. Springer Science & Business Media. ISBN 978-3-642-14846-0.