A formal definition of Bottom-up Embedded Push-Down Automata and their tabulation technique

We provide a formal definition of Bottom-up Embedded Push-Down Automata. By removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this class of automata and to show the equivalence with respect to other models of automata accepting tree adjoining languages. Keywords: Automata, parsing, tabulation, tree adjoining grammars. 1 Introduction Tree adjoining grammars (TAG) [7] are an extension of context-free grammars that use trees instead of productions as the primary representing structure. Formally, a TAG is a 5-tuple G = (V N ; V T ; S; I; A), where VN is a finite set of non-terminal symbols, V T a finite set of terminal symbols, S 2 VN is the axiom of the grammar, I a finite set of initial trees and A a finite set of auxiliary trees. I [ A is the set of elementary trees. Internal nodes are labeled by non-terminals and leaf nodes by terminals or ", except for just one leaf per auxiliary tree (the foot) which is la..