23 citations · 28 across the 5 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2026
Recognizers for Graph-Encoding Languages
Anssi Yli-Jyrä
We introduce recurrent incidence automata (RIAs), a new automaton model motivated by a decomposition of certain two-stack visibly pushdown computations. The decomposition separates…
cs.FL2017★ 2 cited
The Power of Constraint Grammars Revisited
Anssi Yli-Jyrä
Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have lacked clear connections to formal language theory. The purpose of this article is to lay a foundation…