scientific article; zbMATH DE number 1159571
From MaRDI portal
Publication:4391985
Recommendations
- Transformation between regular expressions and \(\omega\)-automata
- From \(\omega\)-regular expressions to Büchi automata via partial derivatives
- Construction of a Deterministicω-Automaton Using Derivatives
- Beyond -regular languages: T-regular expressions and their automata and logic counterparts
- Probabilistic -regular expressions
Cited in
(9)- Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions
- Beyond -regular languages: T-regular expressions and their automata and logic counterparts
- Intersection of \(-\omega \)-regular expressions
- Constructing a --regular expression specified by a graph of elementary extensions
- Beyond BS-regular languages: T-regular expressions and counter-check automata
- Construction of a Deterministicω-Automaton Using Derivatives
- Transformation between regular expressions and \(\omega\)-automata
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- scientific article; zbMATH DE number 7649888 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4391985)
