From

Institution

Field

Type

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

Reset

Papers matching “regular languages” 15

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
Extending Graph Query Languages by Reduction
2024 Technische Universität Berlin – Universitätsbibliothek article Computer Science Model-Driven Software Engineering Techniques Open access

Erhard Weinell

2

citations
On the Boolean Closure of Deterministic Top-Down Tree Automata
2023 International Journal of Foundations of Computer Science article Computer Science semigroups and automata theory Open access

Christof Löding, Wolfgang Thomas

0

citations
Constructing Deterministic Parity Automata from Positive and Negative Examples
2024 TheoretiCS article Computer Science semigroups and automata theory Open access

León Bohn, Christof Löding

8

citations
Layered Automata: A Canonical Model for Automata over Infinite Words
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science semigroups and automata theory Open access

Antonio Casares, Christof Löding, Igor Walukiewicz

0

citations
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
2020 Theoretical Computer Science article Computer Science semigroups and automata theory Open access

Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel

8

citations
Algebras for Deterministic Computation Are Inherently Incomplete
2025 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Balder ten Cate, Tobias Kappé

4

citations
Resynchronized Uniformization and Definability Problems for Rational Relations
2023 Discrete Mathematics & Theoretical Computer Science article Computer Science semigroups and automata theory Open access

Christof Löding, Sarah Winter

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
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
Saturation Problems for Families of Automata
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science semigroups and automata theory Open access

0

citations
Grammars Based on the Shuffle Operation
2020 Zenodo (CERN European Organization for Nuclear Research) article Computer Science semigroups and automata theory Open access

Arto K. Salomaa, Gheorghe Pǎun, Grzegorz Rozenberg

0

citations
Model Checking Temporal Properties of Recursive Probabilistic Programs
2023 Logical Methods in Computer Science article Computer Science Formal Methods in Verification Open access

Christina Gehnen, Joost-Pieter Katoen

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

15 results