scientific article; zbMATH DE number 512864
From MaRDI portal
Publication:4281561
Recommendations
Cited in
(24)- A syntactic congruence for rational -languages
- Language-theoretical representations of \(\omega\)-languages
- Which finite monoids are syntactic monoids of rational \(\omega\)-languages
- Complete interpretations of \(\Omega\)-languages and free algebras of \(\Omega\)-elements
- A syntactic proof of the conservativity of \(\lambda_\omega\) over \(\lambda_2\)
- On syntactic congruences for \(\omega\)-languages
- The disjunctivities of -languages.
- Regular \(\omega\)-languages with an informative right congruence
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
- scientific article; zbMATH DE number 992002 (Why is no real title available?)
- Acceptance Conditions for ω-Languages
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- On?-Languages whose syntactic monoid is trivial
- scientific article; zbMATH DE number 4009840 (Why is no real title available?)
- scientific article; zbMATH DE number 599132 (Why is no real title available?)
- scientific article; zbMATH DE number 604887 (Why is no real title available?)
- Index sets for ω‐languages
- On the minimization problem for \(\omega \)-automata
- Separation property for B- and S-regular languages
- Random walks on semaphore codes and delay de Bruijn semigroups
- FORQ-Based Language Inclusion Formal Testing
- Characterizations of rational \(\omega\)-languages by means of right congruences
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
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 Q4281561)
