4 citations · 20 across the 28 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LO2016
Summaries for Context-Free Games
Lukáš Holík, Roland Meyer, Sebastian Muskalla
We study two-player games played on the infinite graph of sentential forms induced by a context-free grammar (that comes with an ownership partitioning of the non-terminals). The w…
cs.FL2016
Reduction of Nondeterministic Tree Automata
Ricardo Almeida, Lukáš Holík, Richard Mayr
We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotie…