Automata and grammars for data words
From MaRDI portal
Publication:6666782
DOI10.1007/978-3-031-71112-1_1MaRDI QIDQ6666782
Publication date: 20 January 2025
register automatonregister context-free grammarfirst-order logic with data equalityLTL with freeze quantifiernominal automaton
Cites Work
- Unnamed Item
- Active learning for extended finite state machines
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Learning regular sets from queries and counterexamples
- Finite-memory automata
- Context-free languages over infinite alphabets
- Intractability of decision problems for finite-memory automata
- A logical characterization of data languages.
- Generalized register context-free grammars
- Regular expressions for data words
- Two-variable logic on data words
- Querying Graphs with Data
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Finite state machines for strings over infinite alphabets
- A Fresh Approach to Learning Register Automata
- Runtime Verification Based on Register Automata
- Learning nominal automata
- Tree Automata over Infinite Alphabets
- Active learning for deterministic bottom-up nominal tree automata
This page was built for publication: Automata and grammars for data words
