A succinct canonical register automaton model
From MaRDI portal
Publication:478388
DOI10.1016/j.jlamp.2014.07.004zbMath1304.68097OpenAlexW2035955066MaRDI QIDQ478388
Bernhard Steffen, Maik Merten, Bengt Jonsson, Falk Howar, Sofia Cassel
Publication date: 3 December 2014
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2014.07.004
Related Items
A taxonomy and reductions for common register automata formalisms ⋮ A Myhill-Nerode theorem for register automata and symbolic trace languages
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On notions of regularity for data languages
- CCS expressions, finite state processes, and three problems of equivalence
- Learning regular sets from queries and counterexamples
- A theory of timed automata
- Finite-memory automata
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- A logical characterization of data languages.
- Inference of finite automata using homing sequences
- Inferring Canonical Register Automata
- Two-variable logic on data words
- A Succinct Canonical Register Automaton Model
- Linear Automaton Transformations
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Three Partition Refinement Algorithms
- A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations
- Language identification in the limit
This page was built for publication: A succinct canonical register automaton model
