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

DOI10.1016/J.TCS.2014.01.018zbMATH Open1359.68202OpenAlexW2071869647MaRDI QIDQ2449045FDOQ2449045

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

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

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)

Cites Work

• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Universal coalgebra: A theory of systems
• Bisimulation from open maps
• A Coalgebraic Perspective on Minimization and Determinization
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the final sequence of a finitary set functor
• Title not available (Why is that?)
• Theory of átomata
• Terminal coalgebras in well-founded set theory
• A fixpoint theorem for complete categories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Coalgebraic Logic and Synthesis of Mealy Machines
• The algorithmics of bisimilarity
• Non-deterministic Kleene coalgebras
• Generalizing determinization from automata to coalgebras
• Realization of coinductive types
• Power-set functors and saturated trees
• Bisimulation and logic

Cited In (5)

• Title not available (Why is that?)
• 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

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)