2 citations · 3 across the 5 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
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 most…
cs.LO2024★ 1 cited
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…
cs.LO2024★ 2 cited
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…