scientific article; zbMATH DE number 1159571
From MaRDI portal
Publication:4391985
zbMATH Open0899.68059MaRDI QIDQ4391985FDOQ4391985
Authors: Rongfang Bie 
Publication date: 1 November 1998
Title of this publication is not available (Why is that?)
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 \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
- Probabilistic \(\omega \)-regular expressions
Cited In (8)
- Beyond \(\omega BS\)-regular languages: \(\omega T\)-regular expressions and counter-check automata
- Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
- Title not available (Why is that?)
- Transformation between regular expressions and \(\omega\)-automata
- Intersection of \(-\omega \)-regular expressions
- Constructing a \(-\omega\)-regular expression specified by a graph of elementary extensions
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions
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)
