From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “monadic second-order logic” 10

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Computability by monadic second-order logic
2020 Information Processing Letters article Computer Science Computability, Logic, AI Algorithms Open access

Joost Engelfriet

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2023 HAL (Le Centre pour la Communication Scientifique Directe) conference-paper Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Nina Runde

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2025 Leibniz international proceedings in informatics article Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Nina Runde

0

citations
Solution of Church's Problem: A Tutorial Wolfgang Thomas
2025 Routledge eBooks book-chapter Computer Science semigroups and automata theory Open access

Wolfgang Thomas

0

citations
Projection for Büchi Tree Automata with Constraints between Siblings
2020 International Journal of Foundations of Computer Science article Computer Science semigroups and automata theory

Patrick Landwehr, Christof Löding

0

citations
Solving Infinite Games in the Baire Space
2022 Fundamenta Informaticae article Computer Science semigroups and automata theory Open access

Benedikt Brütsch, Wolfgang Thomas

1

citations
Solving Infinite Games in the Baire Space
2021 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Benedikt Brütsch, Wolfgang Thomas

0

citations
Definable decompositions for graphs of bounded linear cliquewidth
2021 Logical Methods in Computer Science article Computer Science Advanced Graph Theory Research Open access

Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk

7

citations
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Tim Seppelt

1

citations

10 results