Efficient algorithms for morphisms over omega-regular languages

DOI10.4230/LIPICS.FSTTCS.2015.112MaRDI QIDQ5278314zbMATH OpenFDO

Authors Lukas Fleischer, Manfred Kufleitner

Publication date 13 July 2017

Full work available at URL https://arxiv.org/abs/1509.06215

zbMATH Keywords

Büchi automataMSOomega-regular languagerecognizing morphismsyntactic semigroup

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35) Algebraic theory of languages and automata (68Q70)

Recommendations

• Operations on weakly recognizing morphisms
• The complexity of weakly recognizing morphisms
• scientific article; zbMATH DE number 512865
• On the minimization problem for \(\omega \)-automata
• scientific article; zbMATH DE number 777280

Cited in

(8)

• Operations on weakly recognizing morphisms
• McCammond’s normal forms for free aperiodic semigroups revisited
• Efficient algorithms for membership in Boolean hierarchies of regular languages
• scientific article; zbMATH DE number 512865 (Why is no real title available?)
• scientific article; zbMATH DE number 777280 (Why is no real title available?)
• scientific article; zbMATH DE number 7300359 (Why is no real title available?)
• The complexity of weakly recognizing morphisms
• Computer Aided Verification

This page was built for publication: Efficient algorithms for morphisms over omega-regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5278314)