Coalgebraic Logic and Synthesis of Mealy Machines
From MaRDI portal
(Redirected from Publication:5458362)
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(13)- Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
- A description based on languages of the final non-deterministic automaton
- Synthesis of Mealy machines using derivatives
- Coalgebraic components in a many-sorted microcosm
- scientific article; zbMATH DE number 6528605 (Why is no real title available?)
- A Kleene Theorem for Polynomial Coalgebras
- Relational properties of sequential composition of coalgebras
- Symbolic synthesis of Mealy machines from arithmetic bitstream functions
- scientific article; zbMATH DE number 2104638 (Why is no real title available?)
- scientific article; zbMATH DE number 7204449 (Why is no real title available?)
- Quantitative Kleene coalgebras
- (Co)algebraic characterizations of signal flow graphs
- A complete theory of sequential digital circuits: denotational, operational and algebraic semantics
This page was built for publication: Coalgebraic Logic and Synthesis of Mealy Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458362)