A description based on languages of the final non-deterministic automaton

DOI10.1016/J.TCS.2014.01.018MaRDI QIDQ2449045zbMATH OpenOpenAlexFDO

Authors Adolfo Ballester-Bolinches, Enric Cosme-Llópez, R. Esteban-Romero

Publication date 6 May 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.01.018

zbMATH Keywords

coalgebraformal languagebisimilaritynondeterministic automatonfinal automaton

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Recommendations

• Bisimulations and behaviour of nondeterministic automata
• Finite nondeterministic automata: simulation and minimality
• Canonical nondeterministic automata
• scientific article; zbMATH DE number 3856418
• Coalgebraic constructions of canonical nondeterministic automata

Cites work

• scientific article; zbMATH DE number 6115908 (Why is no real title available?)
• scientific article; zbMATH DE number 3688686 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 1304993 (Why is no real title available?)
• scientific article; zbMATH DE number 1064116 (Why is no real title available?)
• scientific article; zbMATH DE number 1497879 (Why is no real title available?)
• scientific article; zbMATH DE number 2172972 (Why is no real title available?)
• A Coalgebraic Perspective on Minimization and Determinization
• A fixpoint theorem for complete categories
• Algebraic laws for nondeterminism and concurrency
• Bisimulation and logic
• Bisimulation from open maps
• Coalgebraic Logic and Synthesis of Mealy Machines
• Derivatives of Regular Expressions
• Generalizing determinization from automata to coalgebras
• Non-deterministic Kleene coalgebras
• On the final sequence of a finitary set functor
• Power-set functors and saturated trees
• Realization of coinductive types
• Terminal coalgebras in well-founded set theory
• The algorithmics of bisimilarity
• Theory of átomata
• Universal coalgebra: A theory of systems

Cited in

(5)

• scientific article; zbMATH DE number 3856418 (Why is no real title available?)
• On a question of the Kourovka notebook concerning permutability
• On the category of \(L\)-fuzzy automata, coalgebras and dialgebras
• A categorical approach to minimal realization for a fuzzy language
• Bisimulations and behaviour of nondeterministic automata

Describes a project that uses

Uses Software

• GAP

This page was built for publication: A description based on languages of the final non-deterministic automaton

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449045)