2 citations · 3 across the 4 of their papers we have counts for
4 papers
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…
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 most…
A proof theory of (omega-)context-free languages, via non-wellfounded proofs
Anupam Das, Abhishek De
We investigate the proof theory of regular expressions with fixed points, construed as a notation for (omega-)context-free grammars. Starting with a hypersequential system for regu…
A proof theory of right-linear (omega-)grammars via cyclic proofs
Anupam Das, Abhishek De
Right-linear (or left-linear) grammars are a well-known class of context-free grammars computing just the regular languages. They may naturally be written as expressions with (leas…