Nominal tree automata with name allocation

DOI10.4230/LIPICS.CONCUR.2024.35MaRDI QIDQ6859912zbMATH OpenFDO

Authors Lutz Schröder

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2024.35

zbMATH Keywords

tree automatadata languagesinclusion checkingnominal automata

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• scientific article; zbMATH DE number 7136664 (Why is no real title available?)
• scientific article; zbMATH DE number 7566055 (Why is no real title available?)
• scientific article; zbMATH DE number 7649889 (Why is no real title available?)
• A Linear-Time Nominal μ-Calculus with Name Allocation.
• A robust class of data languages and an application to learning
• Alternating automata on data trees and XPath satisfiability
• Automata theory in nominal sets
• Combining black-box and white-box techniques for learning register automata
• Complexity results on register context-free grammars and register tree automata
• Deciding Equivalence of Finite Tree Automata
• Extending two-variable logic on data trees with order on data values and its automata
• Finite state machines for strings over infinite alphabets
• Finite-memory automata
• Finite-memory automata with non-deterministic reassignment
• Freshness and Name-Restriction in Sets of Traces with Names
• LTL with the freeze quantifier and register automata
• Model checking systems and specifications with parameterized atomic propositions
• Nominal Büchi Automata with Name Allocation
• Nominal automata with name binding
• Nominal sets. Names and symmetry in computer science
• Pillars of computer science. Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday
• Reachability in vector addition systems is primitive-recursive in fixed dimension
• Runtime verification based on register automata
• The containment problem for unambiguous register automata
• Two-variable logic on data trees and XML reasoning
• Two-variable logic on data words
• Unambiguity in automata theory
• Universal coalgebra: A theory of systems
• Walking on data words

This page was built for publication: Nominal tree automata with name allocation

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