Construction of a Deterministicω-Automaton Using Derivatives
From MaRDI portal
Publication:4265535
Recommendations
Cites work
- Derivatives of Regular Expressions
- Finite-state \(\omega\)-languages
- scientific article; zbMATH DE number 3932938 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- On equations for regular languages, finite automata, and sequential networks
- Partial derivatives of regular expressions and finite automata constructions
Cited in
(5)- From \(\omega\)-regular expressions to Büchi automata via partial derivatives
- An improved construction of deterministic omega-automaton using derivatives
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
- scientific article; zbMATH DE number 1159571 (Why is no real title available?)
- Constructing deterministic parity automata from positive and negative examples
This page was built for publication: Construction of a Deterministicω-Automaton Using Derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4265535)