On Minimalism of Analysis by Reduction by Restarting Automata
| Autor: | Markéta Lopatková, Martin Plátek, Dana Pardubská |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Discrete mathematics
Nested word Theoretical computer science Categorial grammar Comparison of multi-paradigm programming languages Abstract family of languages Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Pumping lemma for regular languages TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Equivalence (formal languages) Computer Science::Formal Languages and Automata Theory Natural language Mathematics Word order |
| Zdroj: | Formal Grammar ISBN: 9783662441206 FG ResearcherID |
| DOI: | 10.1007/978-3-662-44121-3_10 |
| Popis: | The paper provides linguistic observations as a motivation for a formal study of an analysis by reduction. It concentrates on a study of the whole mechanism through a class of restarting automata with meta-instructions using pebbles, with delete and shift operations DS-automata. Four types of infinite sets defined by these automata are considered as linguistically relevant: basic languages on word forms marked with grammatical categories, proper languages on unmarked word forms, categorial languages on grammatical categories, and sets of reductions reduction languages. The equivalence of proper languages is considered for a weak equivalence of DS-automata, and the equivalence of reduction languages for a strong equivalence of DS-automata. The complexity of a language is naturally measured by the number of pebbles, the number of deletions, and the number of word order shifts used in a single reduction step. We have obtained unbounded hierarchies scales for all four types of classes of finite languages considered here, as well as for Chomsky's classes of infinite languages. The scales make it possible to estimate relevant complexity issues of analysis by reduction for natural languages. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|