default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 534
Volume 534, May 2014
- Manfred Droste, Heiko Vogler:
Preface. 1
- Zoltán Ésik:
Axiomatizing weighted synchronization trees and weighted bisimilarity. 2-23 - Paul Gastin, Benjamin Monmege
:
Adding pebbles to weighted automata: Easy specification & efficient evaluation. 24-44 - Daniel Kirsten:
An algebraic characterization of semirings for which the support of every recognizable series is recognizable. 45-52 - Karsten Lehmann, Rafael Peñaloza:
The complexity of computing the behaviour of lattice automata on infinite trees. 53-68 - Ingmar Meinecke, Karin Quaas:
Parameterized model checking of weighted networks. 69-85 - Nada Damljanovic, Miroslav Ciric, Jelena Ignjatovic:
Bisimulations for weighted automata over an additively idempotent semiring. 86-100
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
