activity
20172023
most citedDeciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic

3 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.LO2021

Deciding FO-definability of regular languages

Agi Kurucz, Vladislav Ryzhikov, Yury Savateev +1

We prove that, similarly to known PSpace-completeness of recognising FO(<)-definability of the language L(A) of a DFA A, deciding both FO(<,C)- and FO(<,MOD)-definability are PSpac…