Next Article in Journal
Mining Branching Rules from Past Survey Data with an Illustration Using a Geriatric Assessment Survey for Older Adults with Cancer
Next Article in Special Issue
A Gentle Introduction to Applications of Algorithmic Metatheorems for Space and Circuit Classes
Previous Article in Journal
Improved Direct Linear Transformation for Parameter Decoupling in Camera Calibration
Previous Article in Special Issue
Multivariate Algorithmics for Finding Cohesive Subnetworks
Article Menu

Export Article

Open AccessArticle
Algorithms 2016, 9(2), 32; doi:10.3390/a9020032

Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey

Department of Computing Science, Umeå University, SE-901 87 Umeå, Sweden
*
Author to whom correspondence should be addressed.
Academic Editors: Henning Fernau and Florin Manea
Received: 8 March 2016 / Revised: 19 April 2016 / Accepted: 27 April 2016 / Published: 11 May 2016
View Full-Text   |   Download PDF [235 KB, uploaded 11 May 2016]   |  

Abstract

Parsing for mildly context-sensitive language formalisms is an important area within natural language processing. While the complexity of the parsing problem for some such formalisms is known to be polynomial, this is not the case for all of them. This article presents a series of results regarding the complexity of parsing for linear context-free rewriting systems and deterministic tree-walking transducers. We discuss the difference between uniform and nonuniform complexity measures and how parameterized complexity theory can be used to investigate how different aspects of the formalisms influence how hard the parsing problem is. The main results we survey are all hardness results and indicate that parsing is hard even for relatively small values of parameters such as rank and fan-out in a rewriting system. View Full-Text
Keywords: mildly context-sensitive languages; parsing; formal languages; parameterized complexity mildly context-sensitive languages; parsing; formal languages; parameterized complexity
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Björklund, H.; Berglund, M.; Ericson, P. Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey. Algorithms 2016, 9, 32.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top