Titlebook: Relational and Algebraic Methods in Computer Science; 19th International C Uli Fahrenberg,Mai Gehrke,Michael Winter Conference proceedings

lactic

STRIA

季雨

Deciding FO-definability of Regular Languages,nability of . can be captured by ‘localisable’ properties of the transition monoid of .. Using our criterion, we then generalise the known proof of .-hardness of .-definability, and establish the upper bounds not only for arbitrary DFAs but also for 2NFAs.

代理人

Conference proceedings 2021sions. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond. .