The containment problem for unambiguous register automata and unambiguous timed automata

DOI10.1007/s00224-020-09997-2OpenAlexW3087010175MaRDI QIDQ2048204

Antoine Mottet, Karin Quaas

Publication date: 5 August 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-020-09997-2

zbMATH Keywords

timed automatacontainmentunambiguous automataregister automata

Mathematics Subject Classification ID

Theory of computing (68Qxx) General logic (03Bxx) Computability and recursion theory (03Dxx)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Nondeterministic and co-nondeterministic implies deterministic, for data languages

Cites Work

• Unnamed Item
• A theory of timed automata
• Finite-memory automata
• Intractability of decision problems for finite-memory automata
• When are emptiness and containment decidable for probabilistic automata?
• Alternating register automata on finite words and trees
• Forms of Determinism for Automata (Invited Talk)
• LTL with the freeze quantifier and register automata
• Relating timed and register automata
• Multiply-Recursive Upper Bounds with Higman’s Lemma
• FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
• Automata and Logics for Words and Trees over an Infinite Alphabet
• A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton
• The Containment Problem for Unambiguous Register Automata
• Probabilistic Automata of Bounded Ambiguity
• Finite state machines for strings over infinite alphabets
• Unambiguity in Automata Theory
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY

This page was built for publication: The containment problem for unambiguous register automata and unambiguous timed automata