A succinct canonical register automaton model

DOI10.1016/J.JLAMP.2014.07.004MaRDI QIDQ478388zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

automata theorycanonical modeldata languagesMyhill-Neroderegister automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1759637 (Why is no real title available?)
• scientific article; zbMATH DE number 1418451 (Why is no real title available?)
• A Succinct Canonical Register Automaton Model
• A logical characterization of data languages.
• A succinct canonical register automaton model for data domains with binary relations
• A theory of timed automata
• An algebraic characterization of deterministic regular languages over infinite alphabets.
• Automata and Logics for Words and Trees over an Infinite Alphabet
• CCS expressions, finite state processes, and three problems of equivalence
• Finite-memory automata
• Inference of finite automata using homing sequences
• Inferring canonical register automata
• Language identification in the limit
• Learning regular sets from queries and counterexamples
• Linear Automaton Transformations
• On notions of regularity for data languages
• Three Partition Refinement Algorithms
• Two-variable logic on data words

Cited in

(8)

• A robust class of data languages and an application to learning
• A Succinct Canonical Register Automaton Model
• A fresh approach to learning register automata
• A Myhill-Nerode theorem for register automata and symbolic trace languages
• Inferring canonical register automata
• A taxonomy and reductions for common register automata formalisms
• A succinct canonical register automaton model for data domains with binary relations
• scientific article; zbMATH DE number 7361373 (Why is no real title available?)

Describes a project that uses

Uses Software

• XMPP

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)