From $$\omega $$-Regular Expressions to Büchi Automata via Partial Derivatives

DOI10.1007/978-3-319-15579-1_22zbMath1451.68162OpenAlexW621285538MaRDI QIDQ2799180

Martin Sulzmann, Peter Thiemann

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_22

zbMATH Keywords

derivatives\(\omega\)-regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression, Location based automata for expressions with shuffle, Intersection of \(-\omega \)-regular expressions, Constructing a \(-\omega\)-regular expression specified by a graph of elementary extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• Partial Derivatives of an Extended Regular Expression
• An Improved Construction of Deterministic Omega-automaton Using Derivatives
• Construction of a Deterministicω-Automaton Using Derivatives
• Rewriting regular inequalities
• Derivatives of Regular Expressions