A Uniform Framework for Problems on Context-Free Grammars
Formal Languages and Automata Theory
2024-10-28 v1
Abstract
In a paper published in Information Processing Letters in 2000, Bouajjani et al. presented an automata-based approach to a number of elementary problems on context-free grammars. This approach is of pedagogical interest since it provides a uniform solution to decision procedures usually solved by independent algorithms in textbooks. This paper improves upon the work by Bouajjani et al. in a number of ways. We present a new algorithm which not only has a better space complexity but is also (in our opinion) easier to read and understand. Moreover, a closer inspection reveals that the new algorithm is competitive to well-known solutions for most (but not all) standard problems.
Cite
@article{arxiv.2410.19386,
title = {A Uniform Framework for Problems on Context-Free Grammars},
author = {Javier Esparza and Peter Rossmanith and Stefan Schwoon},
journal= {arXiv preprint arXiv:2410.19386},
year = {2024}
}