3 papers
math.LO2025
Undecidability of theories of semirings with fixed points
Anupam Das, Abhishek De, Stepan L. Kuznetsov
In this work we prove the undecidability (and -completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoreti…
math.LO2025
An algebraic theory of Ï-regular languages, via μν-expressions
Anupam Das, Abhishek De
Alternating parity automata (APAs) provide a robust formalism for modelling infinite behaviours and play a central role in formal verification. Despite their widespread use, the al…
cs.LO2025
Cyclic system for an algebraic theory of alternating parity automata
Anupam Das, Abhishek De
-regular languages are a natural extension of the regular languages to the setting of infinite words. Likewise, they are recognised by a host of automata models, one of the mos…