Transformation between regular expressions and -automata

DOI10.4230/LIPICS.MFCS.2016.88MaRDI QIDQ4608652zbMATH OpenFDO

Authors Christof Löding, Andreas Tollkötter

Publication date 21 March 2018

zbMATH Keywords

parity automatainfinity regular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• From \(\omega\)-regular expressions to Büchi automata via partial derivatives
• scientific article; zbMATH DE number 1159571
• -automata
• Regular expressions for languages over infinite alphabets
• Probabilistic \(\omega \)-regular expressions

Cited in

(9)

• Beyond \(\omega BS\)-regular languages: \(\omega T\)-regular expressions and counter-check automata
• -automata
• Flexible coinductive logic programming
• scientific article; zbMATH DE number 1472276 (Why is no real title available?)
• Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression
• From \(\omega\)-regular expressions to Büchi automata via partial derivatives
• Intersection of \(-\omega \)-regular expressions
• Constructing a \(-\omega\)-regular expression specified by a graph of elementary extensions
• Completeness results for omega-regular algebras

This page was built for publication: Transformation between regular expressions and \(\omega\)-automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608652)