48 citations · 114 across the 32 of their papers we have counts for
42 papers
The Word Problem for -Terms over
Jorge Almeida, Manfred Kufleitner, Jan Philipp Wächter
We give a ranker-based description using finite-index congruences for the variety of finite monoids whose regular -classes form Abelian gro…
Yet another proof of Parikh's Theorem
Manfred Kufleitner
Parikh's Theorem says that the Parikh image of a context-free language is semilinear. We give a short proof of Parikh's Theorem using the formulation of Verma, Seidl, and Schwentic…
Reachability Games and Parity Games
Volker Diekert, Manfred Kufleitner
Parity games are positionally determined. This is a fundamental and classical result. In 2010, Calude et al. showed a breakthrough result for finite parity games: the winning regio…
The Inclusion Problem for Forest Languages under Substitutions
Marcial Gaißert, Manfred Kufleitner
We consider algorithms and lower bounds for various problems over forest languages; as input models we allow forest algebras, deterministic forest automata and nondeterministic for…
Conelikes and Ranker Comparisons
Viktor Henriksson, Manfred Kufleitner
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belong…
Deciding FO2 Alternation for Automata over Finite and Infinite Words
Viktor Henriksson, Manfred Kufleitner
We consider two-variable first-order logic and its quantifier alternation hierarchies over both finite and infinite words. Our main results are forbidden patterns for…