<?xml version="1.0" standalone="yes"?>
<Paper uid="C88-2105">
  <Title>LIST. AUTOMATA WITH SYNTAC'\]\[&amp;quot; I CAL LY STRUCTURED OU~ PU~ ~</Title>
  <Section position="4" start_page="499" end_page="499" type="ackno">
    <SectionTitle>
3. Conslusions
</SectionTitle>
    <Paragraph position="0"> The type of automaton introduced is, in our opinion, important for several reasons.</Paragraph>
    <Paragraph position="1"> First, it allows for stepwise refinemen~ of the set of its complex operations: first, only an acceotor might be constructed, and only later its operations can be augmented to a real parser. Of course, the augmentation of the primary acceptor and turning it into the parser might be performed in most different ways, which allows for incarnating various linguistic theories over the initial acceptor. Cenerally, we can start the process of creating the automaton by cor~structing the csmplex operations from basic operations DEL and GO only, applying these two basic operations ,to the pointers L,R and THIS solely (i.e., only pointers from the input list).</Paragraph>
    <Paragraph position="2"> D'ring its computation, such an accept or will simulate the derivation of the input string (string represented by the'input list). In the second step, i.e. in building the parser, we augment these primitive complex operations by adding other basic operations and/or using other pointers, to get, eventually, the intended parser.</Paragraph>
    <Paragraph position="3"> Second, from the linguistic viewpoint, it enables to construct a recognizing automaton - a full syntactic parser (i.e., an automaton which gives a syntacticstructure as its output) - which, in addition, allows to prove the context-freeness of the processed languages, but on grounds profoundly different than those of (Gazdar,Klein,Pullum and Sag,85).</Paragraph>
    <Paragraph position="4"> Third, from the formal viewpoint, it allows to describe the whole Chomsky hierarchy of languages by a sln__i_nnf~ abstract automaton with differently limited set of operations rather than with a whole set of relatively unrelated types of machines (Turing machine, linearly bounded automaton, pushdown automaton, finite automaton): this is because the operations of the proposed automaton are in fact Just refined operations of the llst automaton proposed in (Chytil, Pl&amp;tek and Vogel,86).</Paragraph>
  </Section>
class="xml-element"></Paper>