A Note on Star-Free Events
From MaRDI portal
Cited in
(18)- -languages accepted by finite automata whose structures are cascade products o resets
- Star-free trace languages
- Modulo-counting quantifiers over finite trees
- Alternating finite automata and star-free languages
- Closure properties of subregular languages under operations
- On the expressive power of temporal logic
- Dot-depth of star-free events
- Classification of noncounting events
- Theme and variations on the concatenation product
- Extensions of an idea of McNaughton
- On the Krohn-Rhodes cascaded decomposition theorem
- First-order properties of trees, star-free expressions, and aperiodicity
- Power-separating regular languages
- scientific article; zbMATH DE number 7559475 (Why is no real title available?)
- Remarks on algebraic decomposition of automata
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Closure properties of subregular languages under operations
- On the expressive power of temporal logic for infinite words
This page was built for publication: A Note on Star-Free Events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5631023)