From Context-Free Languages to Mildly Context-Sensitive Languages Complexity Views

Authors

  • Liliana Cojocaru „Petre Andrei” University of Iaşi, Romania Author

DOI:

https://doi.org/10.63331/upalaw/32/03

Keywords:

context-free languages, alternating Turing machines, Boolean matrix multiplication

Abstract

The class of context-free languages is the second class in the Chomsky hierarchy, and probably it is the most exciting one. It is easy to be parsed but not trivial, it is rich in algebraic and combinatorial properties, it stands at the basis of programming languages, and besides, it provides structural patterns for the so called mildly context-sensitive formalisms used in Natural Language Processing. Usually parsing algorithms for mildly context-sensitive grammars are generalized parsing algorithms for context-free grammars. In this paper we deal with the main parsing algorithms for context-free and mildly context-sensitive grammars, motivated by potential applications in Computational Complexity, Parsing Theory and DNA Computing. These algorithms are based on graphical, combinatorial, or algebraic approaches, on Boolean matrix multiplication techniques and on regular approximations for context-free and mildly context-sensitive languages.

Author Biography

  • Liliana Cojocaru, „Petre Andrei” University of Iaşi, Romania

    Lecturer Ph.D., „Petre Andrei” University of Iaşi & „Alexandru Ioan Cuza” University, Departament of Computer Science

Downloads

Published

2025-05-11