A coalgebraic view of -transitions

DOI10.1007/978-3-642-40206-7_20zbMATH Open1395.68193OpenAlexW1742845879MaRDI QIDQ2848955FDOQ2848955

Authors: Alexandra Silva, Bram Westerbaan 

Publication date: 13 September 2013

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40206-7_20

Recommendations

• Algebraic elimination of \(\epsilon\)-transitions
• The Removal of Weighted ε-Transitions
• Removing \(\epsilon \)-transitions in timed automata
• scientific article; zbMATH DE number 1775630
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cited In (8)

• Coalgebraic semantics for nominal automata
• A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves
• Behavioural equivalences for timed systems
• Title not available (Why is that?)
• Algebraic elimination of \(\epsilon\)-transitions
• Behavioural equivalences for coalgebras with unobservable moves
• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
• How to Kill Epsilons with a Dagger

This page was built for publication: A coalgebraic view of \(\varepsilon \)-transitions

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