2021/07/27 by Shankara Narayanan Krishna, Krishna, Shankara Narayanan, Khushraj Madnani +7
Computer Science · Mathematics · #Algorithm #Automaton #Class (philosophy) #Computer science #Decidability #Discrete mathematics #Emptiness #F.1.1 #F.4.1 #F.4.3 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Mathematics #Theoretical computer science #Timed automaton #Undecidable problem #cs.FL #cs.LO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2107.12986
published in arXiv (Cornell University) (Cornell University) · arXiv admin note: text overlap with arXiv:2105.09534
openalex publication_date 2021/07/27 · arxiv created 2022/02/26 · arxiv updated 2022/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
In this paper, we study the extension of 1-clock Alternating Timed Automata (1-ATA) with the ability to read in both forward and backward direction, the 2-Way 1-clock Alternating Timed Automata (2-Way 1-ATA). We show that subclass of 2-Way 1-ATA with reset free loops (2-Way 1-ATA-rfl) is expressively equivalent to MSO[