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

DOI10.1016/j.tcs.2014.01.018zbMath1359.68202OpenAlexW2071869647MaRDI QIDQ2449045

Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Ramón 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)

Related Items

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

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the final sequence of a finitary set functor
• Universal coalgebra: A theory of systems
• Bisimulation from open maps
• Terminal coalgebras in well-founded set theory
• A fixpoint theorem for complete categories
• Non-Deterministic Kleene Coalgebras
• A Coalgebraic Perspective on Minimization and Determinization
• Power-Set Functors and Saturated Trees.
• Algebraic laws for nondeterminism and concurrency
• Generalizing determinization from automata to coalgebras
• Theory of Átomata
• The algorithmics of bisimilarity
• Bisimulation and logic
• Coalgebraic Logic and Synthesis of Mealy Machines
• Derivatives of Regular Expressions
• Realization of Coinductive Types