Cyclic Proofs and Jumping Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Cyclic Proofs and Jumping Automata


We consider a fragment of a cyclic sequent proof system for Kleene algebra, and we see it as a computational device for recognising languages of words. The starting proof system is linear and we show that it captures precisely the regular languages. When adding the standard contraction rule, the expressivity raises significantly; we characterise the corresponding class of languages using a new notion of multi-head finite automata, where heads can jump.
Fichier principal
Vignette du fichier
main.pdf (540.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02301651 , version 1 (30-09-2019)
hal-02301651 , version 2 (08-01-2020)



Denis Kuperberg, Laureline Pinault, Damien Pous. Cyclic Proofs and Jumping Automata. FSTTCS, Dec 2019, Bombay, India. ⟨10.4230/LIPIcs.FSTTCS.2019.45⟩. ⟨hal-02301651v2⟩
228 View
519 Download



Gmail Facebook X LinkedIn More