From

Institution

Field

Type

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

Reset

Papers matching “deterministic finite automata” 18

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata
2020 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Elisabet Burjons, Fabian Frei, Martin Raszyk

0

citations
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata
2021 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science semigroups and automata theory

Elisabet Burjons, Fabian Frei, Martin Raszyk

0

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
Constructing deterministic $ω$-automata from examples by an extension of the RPNI algorithm
2021 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

León Bohn, Christof Löding

1

citations
Enhancing Blockchain Scalability in Power Systems Through Ultra-Fast Second-Layer Channel with Deterministic State Integrity
2026 RWTH Publications (RWTH Aachen) article Computer Science Blockchain Technology Applications and Security Open access

Roua Hamila, César Cazal, Md. Razaul Haque Subho, Ferdinanda Ponci, Thomas Rose, Antonello Monti

0

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
Layered automata: A canonical model for automata over infinite words
2026 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Antonio Casares, Christof Löding, Igor Walukiewicz

0

citations
Layered automata: A canonical model for automata over infinite words
2026 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Antonio Casares, Christof Löding, Igor Walukiewicz

0

citations
Synthesis from Weighted Specifications with Partial Domains over Finite Words
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Formal Methods in Verification Open access

Emmanuel Filiot, Christof Löding, Sarah Winter

7

citations
Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
2025 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Jan Heemstra, Jan Martens, Anton Wijs

0

citations
An Evaluation of Massively Parallel Algorithms for DFA Minimization
2024 Electronic Proceedings in Theoretical Computer Science article Computer Science semigroups and automata theory Open access

Jan Martens, Anton Wijs

0

citations
Finite-valued Streaming String Transducers
2025 TheoretiCS article Computer Science semigroups and automata theory Open access

Emmanuel Filiot, Ismaël Jecker, Anca Muscholl, Gabriele Puppis, Sarah Winter

2

citations
Deciding minimal distinguishing DFAs is NP-complete
2023 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Jan Martens

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
Saturation Problems for Families of Automata
2025 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

León Bohn, Christof Löding, Sven Schewe

0

citations
A Regular and Complete Notion of Delay for Streaming String Transducers
2022 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter

1

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

18 results