6 papers
Finer characterization of bounded languages described by GF(2)-grammars
Vladislav Makarov, Marat Movsin
GF(2)-grammars are a somewhat recently introduced grammar family that have some unusual algebraic properties and are closely connected to unambiguous grammars. In "Bounded language…
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…
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…
Counting ternary square-free words quickly
Vladislav Makarov
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length over the alphabet is presented.
Playing odds and evens with finite automata
Vladislav Makarov
This paper is concerned with asymptotic behaviour of a repeated game of "odds and evens", with strategies of both players represented by finite automata. It is proved that, for eve…
Bounded Languages Described by GF(2)-grammars
Vladislav Makarov
GF(2)-grammars are a recently introduced grammar family with some unusual algebraic properties. They are closely connected to unambiguous grammars. By using the method of formal po…