Computer science/Automata and formal languages
Subject Classification
ACM: Theory of computation~Formal languages and automata theory
AMS: Computer scienece / Theory of computing / Formal languages and automata
2023
Labeled Transition Systems
by Anders Schlichtkrull, Morten Konggaard Schou, Jiří Srba and Dmitriy Traytel
2022
A Verified Translation of Multitape Turing Machines into Singletape Turing Machines
by Christian Dalvit and René Thiemann
2021
Regular Tree Relations
by Alexander Lochmann, Bertram Felgenhauer, Christian Sternagel, René Thiemann and Thomas Sternagel
2020
Inference of Extended Finite State Machines
by Michael Foster, Achim D. Brucker, Ramsay G. Taylor and John Derrick
A Formal Model of Extended Finite State Machines
by Michael Foster, Achim D. Brucker, Ramsay G. Taylor and John Derrick
An Efficient Normalisation Procedure for Linear Temporal Logic: Isabelle/HOL Formalisation
by Salomon Sickert
Formalization of an Optimized Monitoring Algorithm for Metric First-Order Dynamic Logic with Aggregations
by Thibault Dardinier, Lukas Heimes, Martin Raszyk, Joshua Schneider and Dmitriy Traytel
2019
Communicating Concurrent Kleene Algebra for Distributed Systems Specification
by Maxime Buyse and Jason Jaskolka
Formalization of a Monitoring Algorithm for Metric First-Order Temporal Logic
by Joshua Schneider and Dmitriy Traytel
A Compositional and Unified Translation of LTL into ω-Automata
by Benedikt Seidl and Salomon Sickert
Universal Turing Machine
by Jian Xu, Xingyuan Zhang, Christian Urban, Sebastiaan J. C. Joosten and Franz Regensburger
2018
Upper Bounding Diameters of State Spaces of Factored Transition Systems
by Friedrich Kurz and Mohammad Abdulaziz
2017
2016
POSIX Lexing with Derivatives of Regular Expressions
by Fahad Ausaf, Roy Dyckhoff and Christian Urban
Kleene Algebras with Domain
by Victor B. F. Gomes, Walter Guttmann, Peter Höfner, Georg Struth and Tjark Weber
2015
2014
Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions
by Dmitriy Traytel and Tobias Nipkow
Converting Linear-Time Temporal Logic to Generalized Büchi Automata
by Alexander Schimpf and Peter Lammich
A Fully Verified Executable LTL Model Checker
by Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf and Jan-Georg Smaus
Kleene Algebra with Tests and Demonic Refinement Algebras
by Alasdair Armstrong, Victor B. F. Gomes and Georg Struth
2013
2012
2011
The Myhill-Nerode Theorem Based on Regular Expressions
by Chunhan Wu, Xingyuan Zhang and Christian Urban