Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=534
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Axiomatizing weighted synchronization trees and weighted bisimilarity
Z. Ésik
Theoretical Computer Science
534
, 2014, pp. 2-23
Adding pebbles to weighted automata: Easy specification & efficient evaluation
Paul Gastin
,
Benjamin Monmege
Theoretical Computer Science
534
, 2014, pp. 24-44
An algebraic characterization of semirings for which the support of every recognizable series is recognizable
Daniel Kirsten
Theoretical Computer Science
534
, 2014, pp. 45-52
The complexity of computing the behaviour of lattice automata on infinite trees
Karsten Lehmann
,
Rafael Peñaloza
Theoretical Computer Science
534
, 2014, pp. 53-68
Parameterized model checking of weighted networks
Ingmar Meinecke
,
Karin Quaas
Theoretical Computer Science
534
, 2014, pp. 69-85
Bisimulations for weighted automata over an additively idempotent semiring
Nada Damljanović
,
Miroslav Ćirić
,
Jelena Ignjatović
Theoretical Computer Science
534
, 2014, pp. 86-100