Showing 2022Show all
2 papers · 1 filter
cs.FL2022
Cocke--Younger--Kasami--Schwartz--Zippel algorithm and relatives
Vladislav Makarov
The equivalence problem for unambiguous grammars is an important, but very difficult open question in formal language theory. Consider the \emph{limited} equivalence problem for un…
cs.FL2022
Why the equivalence problem for unambiguous grammars has not been solved back in 1966?
Vladislav Makarov
In 1966, Semenov, by using a technique based on power series, suggested an algorithm that tells apart the languages described by an unambiguous grammar and a DFA. At the first glan…