Nondeterministic and co-nondeterministic implies deterministic, for data languages
From MaRDI portal
Publication:2233422
DOI10.1007/978-3-030-71995-1_19MaRDI QIDQ2233422
Szymon Toruńczyk, Bartek Klin, Sławomir Lasota
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-71995-1_19
nominal sets; data languages; register automata; determinizability; sets with atoms; deterministic separability; orbit-finite sets
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Finite-memory automata
- Typechecking for XML transformers
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Intractability of decision problems for finite-memory automata
- The containment problem for unambiguous register automata and unambiguous timed automata
- Regular expressions for data words
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- Modelling Infinite Structures with Atoms
- Nominal Sets
- Automata theory in nominal sets
- An extension of data automata that captures XPath
- Forms of Determinism for Automata (Invited Talk)
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- Generalized Data Automata and Fixpoint Logic
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
- Logics with rigidly guarded data tests
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Finite state machines for strings over infinite alphabets
- Minimization of symbolic automata
