Nondeterministic and co-nondeterministic implies deterministic, for data languages

DOI10.1007/978-3-030-71995-1_19OpenAlexW3137262423MaRDI QIDQ2233422FDOQ2233422

Authors: Bartek Klin, Sławomir Lasota, Szymon Toruńczyk 

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-71995-1_19

zbMATH Keywords

nominal setsdata languagesregister automatadeterminizabilitysets with atomsdeterministic separabilityorbit-finite sets

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites Work

• Nominal sets. Names and symmetry in computer science
• LTL with the freeze quantifier and register automata
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Two-variable logic on data words
• Finite-memory automata
• An extension of data automata that captures XPath
• Finite-memory automata with non-deterministic reassignment
• An algebraic characterization of deterministic regular languages over infinite alphabets.
• Data monoids
• Typechecking for XML transformers
• Finite state machines for strings over infinite alphabets
• Intractability of decision problems for finite-memory automata
• Minimization of symbolic automata
• Automata theory in nominal sets
• Regular expressions for languages over infinite alphabets
• Forms of determinism for automata
• Regular expressions for data words
• The containment problem for unambiguous register automata and unambiguous timed automata
• Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
• Modelling infinite structures with atoms
• Generalized Data Automata and Fixpoint Logic
• Logics with rigidly guarded data tests

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Nondeterministic and co-nondeterministic implies deterministic, for data languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233422)