Abstract
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 (in)finite 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.
The paper reports on the research supported by the grants of GAČR No. P202/10/1333 and partially P103/10/0783. The third author is supported by the Slovak Grant Agency for Science (VEGA) under the contract No. 1/0979/12.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajdukiewicz, K.: Die syntaktische Konnexität. Studia Philosophica I, 1–27 (1935)
Chomsky, N.: Formal Properties of Grammar. In: Handbook of Mathematical Psychology, vol. II, pp. 323–418. John Wiley and Sons, Inc. (1963)
Hajič, J., Panevová, J., Hajičová, E., Sgall, P., Pajas, P., Štěpánek, J., Havelka, J., Mikulová, M., Žabokrtský, Z., Ševčíková-Razímová, M.: Prague Dependency Treebank 2.0. Linguistic Data Consortium, Philadelphia (2006)
Kuboň, V., Lopatková, M., Plátek, M.: On Formalization of Word Order Properties. In: Gelbukh, A. (ed.) CICLing 2012, Part I. LNCS, vol. 7181, pp. 130–141. Springer, Heidelberg (2012)
Mráz, F.: Lookahead Hierarchies of Restarting Automata. Journal of Automata, Languages and Combinatorics 6(4), 493–506 (2001)
Mráz, F., Otto, F., Plátek, M.: The degree of Word-Expansion of Lexicalized RRWW-automata: A New Measure for the Degree of Nondeterminism of (Context-Free) Languages. Theoretical Computer Science 410(37), 3530–3538 (2009)
Plátek, M., Mráz, F., Lopatková, M. (In)Dependencies in Functional Generative Description by Restarting Automata. In: Bordihn, H., et al. (eds.) Proceedings of NCMA 2010. books@ocg.at, vol. 263, pp. 155–170. Österreichische Computer Gesellschaft, Wien (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Plátek, M., Pardubská, D., Lopatková, M. (2014). On Minimalism of Analysis by Reduction by Restarting Automata. In: Morrill, G., Muskens, R., Osswald, R., Richter, F. (eds) Formal Grammar. FG 2014. Lecture Notes in Computer Science, vol 8612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44121-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-44121-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44120-6
Online ISBN: 978-3-662-44121-3
eBook Packages: Computer ScienceComputer Science (R0)