From

Institution

Field

Type

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

Reset

Papers matching “language equivalence” 7

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Every Regular Language Has a Bipartite Cactus Automaton
2026 Electronic Proceedings in Theoretical Computer Science article Computer Science semigroups and automata theory Open access

Mario Grobler, Till Koziel, Sebastian Siebertz

0

citations
An Elementary Proof of the FMP for Kleene Algebra
2026 Fundamenta Informaticae article Computer Science semigroups and automata theory Open access

Tobias Kappé

1

citations
StacKAT: Infinite State Network Verification
2025 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Jules Jacobs, Nate Foster, Tobias Kappé, Dexter C. Kozen, Lily Saada, Alexandra Silva, +1 more

0

citations
Session Coalgebras: A Coalgebraic View on Regular and Context-free Session Types
2022 ACM Transactions on Programming Languages and Systems article Computer Science Logic, programming, and type systems Open access

Alex C. Keizer, Henning Basold, Jorge A. Pérez

4

citations
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science semigroups and automata theory Open access

León Bohn, Christof Löding

1

citations
Semiring Provenance for Fixed-Point Logic
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Logic, Reasoning, and Knowledge Open access

Katrin M. Dannert, Erich Grädel, Matthias Naaf, Val Tannen

12

citations
Recursive Querying of Neural Networks via Weighted Structures
2026 Proceedings of the ACM on Management of Data article Computer Science Logic, Reasoning, and Knowledge

Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche

0

citations

7 results