Variable Automata over Infinite Alphabets

DOI10.1007/978-3-642-13089-2_47zbMath1284.68352OpenAlexW1580943896MaRDI QIDQ3564896

Orna Kupferman, Sarai Sheinvald, Orna Grumberg

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_47

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

Nominal Automata for Resource Usage Control ⋮ On temporal logics with data variable quantifications: decidability and complexity ⋮ Layered memory automata: recognizers for quasi-regular languages with unbounded memory ⋮ Set augmented finite automata over infinite alphabets ⋮ Forward and backward application of symbolic tree transducers ⋮ Inferring Symbolic Automata ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Unnamed Item ⋮ Nominal Automata with Name Binding ⋮ Using variable automata for querying data graphs ⋮ Variable Tree Automata over Infinite Ranked Alphabets ⋮ Extending two-variable logic on data trees with order on data values and its automata ⋮ Regular and context-free nominal traces ⋮ Model checking usage policies ⋮ Document Spanners ⋮ A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours ⋮ An automata-theoretic approach to model-checking systems and specifications over infinite data domains ⋮ Regular expressions for data words

This page was built for publication: Variable Automata over Infinite Alphabets