Linear iterated pushdowns

Article English OPEN
Weir, David;
(1994)
  • Publisher: Wiley-Blackwell
  • Identifiers: doi: 10.1111/j.1467-8640.1994.tb00007.x
  • Subject: QA75 | QA76
    acm: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES | TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES
    arxiv: Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) | Computer Science::Formal Languages and Automata Theory | Computer Science::Logic in Computer Science

This paper discusses variants of nondeterministic one-way S-automata and context-free S-grammars where S is a storage type. The framework that these systems provide can be used to give alternative formulations of embedded pushdown automata and linear indexed grammars. T... View more
Share - Bookmark