The containment problem for unambiguous register automata and unambiguous timed automata
type: Item
instance of: scholarly article
title: The containment problem for unambiguous register automata and unambiguous timed automata
author: Antoine Mottet
author: Karin Quaas
published in: Theory of Computing Systems
publication date: 2021-08-05T00:00:00Z
Mathematics Subject Classification ID: 03Bxx
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 03Dxx
zbMATH DE Number: 7379113
zbMATH Keywords: containment
zbMATH Keywords: unambiguous automata
zbMATH Keywords: register automata
zbMATH Keywords: timed automata
MaRDI profile type: Publication
full work available at URL: s00224-020-09997-2
OpenAlex ID: W3087010175
cites work: A theory of timed automata
cites work: Forms of determinism for automata
cites work: Unambiguity in Automata Theory
cites work: When are emptiness and containment decidable for probabilistic automata?
cites work: LTL with the freeze quantifier and register automata
cites work: Alternating register automata on finite words and trees
cites work: Relating timed and register automata
cites work: Probabilistic Automata of Bounded Ambiguity
cites work: Finite-memory automata
cites work: FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
cites work: DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
cites work: Q5002827
cites work: The Containment Problem for Unambiguous Register Automata
cites work: Finite state machines for strings over infinite alphabets
cites work: A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton
cites work: Intractability of decision problems for finite-memory automata
cites work: Multiply-Recursive Upper Bounds with Higman’s Lemma
cites work: Automata and Logics for Words and Trees over an Infinite Alphabet
DOI: 10.1007/S00224-020-09997-2
description: scientific article; zbMATH DE number 7379113