Risultati di ricerca
8 ore fa · 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 regular expressions due to Das and Pous [], we define its extension by least fixed points and prove the soundness and completeness of its non-wellfounded proofs for the standard language model.
