Uniformisations of regular relations over bi-infinite words

DOI10.1145/3373718.3394782zbMATH Open1498.03092OpenAlexW3032742863MaRDI QIDQ5145649FDOQ5145649

Grzegorz Fabiański, Szymon Toruńczyk, Michał Skrzypczak

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373718.3394782

Recommendations

• scientific article; zbMATH DE number 6741931
• scientific article; zbMATH DE number 7376069
• Publication:4941148
• Infinite and bi-infinite words with decidable monadic theories
• Two decidability problems for infinite words

zbMATH Keywords

monadic second-order logicbi-infinite wordsuniformisation

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Higher-order logic (03B16) Decidability of theories and sets of sentences (03B25)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Uniformisations of regular relations over bi-infinite words

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