A succinct canonical register automaton model
From MaRDI portal
Publication:478388
DOI10.1016/J.JLAMP.2014.07.004zbMATH Open1304.68097OpenAlexW2035955066MaRDI QIDQ478388FDOQ478388
Authors: S. Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen 
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
Recommendations
- A Succinct Canonical Register Automaton Model
- A succinct canonical register automaton model for data domains with binary relations
- Inferring canonical register automata
- scientific article; zbMATH DE number 7361373
- scientific article; zbMATH DE number 2053215
- A taxonomy and reductions for common register automata formalisms
- A canonical semi-deterministic transducer
- Determinisation of finitely-ambiguous copyless cost register automata
- Model checking succinct and parametric one-counter automata
Cites Work
- A theory of timed automata
- Title not available (Why is that?)
- Learning regular sets from queries and counterexamples
- Language identification in the limit
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Three Partition Refinement Algorithms
- CCS expressions, finite state processes, and three problems of equivalence
- Two-variable logic on data words
- Finite-memory automata
- On notions of regularity for data languages
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Inference of finite automata using homing sequences
- Linear Automaton Transformations
- Title not available (Why is that?)
- A logical characterization of data languages.
- Inferring canonical register automata
- A Succinct Canonical Register Automaton Model
- Title not available (Why is that?)
- A succinct canonical register automaton model for data domains with binary relations
Cited In (8)
- A robust class of data languages and an application to learning
- A Succinct Canonical Register Automaton Model
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- Title not available (Why is that?)
- A fresh approach to learning register automata
- A taxonomy and reductions for common register automata formalisms
- Inferring canonical register automata
- A succinct canonical register automaton model for data domains with binary relations
Uses Software
This page was built for publication: A succinct canonical register automaton model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q478388)
