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=327
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A hierarchy of probabilistic system types
Falk Bartels
,
Ana Sokolova
,
Erik de Vink
Theoretical Computer Science
327
(1-2), 2004, pp. 3-22
A coalgebraic approach to Kleene algebra with tests
Hubie Chen
,
Riccardo Pucella
Theoretical Computer Science
327
(1-2), 2004, pp. 23-44
A compositional approach to defining logics for coalgebras
Corina Cîrstea
Theoretical Computer Science
327
(1-2), 2004, pp. 45-69
Simulations in coalgebra
Jesse Hughes
,
Bart Jacobs
Theoretical Computer Science
327
(1-2), 2004, pp. 71-108
Stone coalgebras
Clemens Kupke
,
Alexander Kurz
,
Yde Venema
Theoretical Computer Science
327
(1-2), 2004, pp. 109-134
Category theory for operational semantics
Marina Lenisa
,
John Power
,
Hiroshi Watanabe
Theoretical Computer Science
327
(1-2), 2004, pp. 135-154
Substitution in non-wellfounded syntax with variable binding
Ralph Matthes
,
Tarmo Uustalu
Theoretical Computer Science
327
(1-2), 2004, pp. 155-174
A coalgebraic view on positive modal logic
Alessandra Palmigiano
Theoretical Computer Science
327
(1-2), 2004, pp. 175-195
Behavioral abstraction is hiding information
Grigore Roşu
Theoretical Computer Science
327
(1-2), 2004, pp. 197-221
Synchronizing monotonic automata
D.S. Ananichev
,
M.V. Volkov
Theoretical Computer Science
327
(3), 2004, pp. 225-239
NFA reduction algorithms by means of regular inequalities
J.-M. Champarnaud
,
F. Coulon
Theoretical Computer Science
327
(3), 2004, pp. 241-253
Well quasi-orders and context-free grammars
Flavio D'Alessandro
,
Stefano Varricchio
Theoretical Computer Science
327
(3), 2004, pp. 255-268
Frequency of symbol occurrences in bicomponent stochastic models
Diego de Falco
,
Massimiliano Goldwurm
,
Violetta Lonati
Theoretical Computer Science
327
(3), 2004, pp. 269-300
Deleting string rewriting systems preserve regularity
Dieter Hofbauer
,
Johannes Waldmann
Theoretical Computer Science
327
(3), 2004, pp. 301-317
On deterministic finite automata and syntactic monoid size
Markus Holzer
,
Barbara König
Theoretical Computer Science
327
(3), 2004, pp. 319-347
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Ines Klimann
,
Sylvain Lombardy
,
Jean Mairesse
,
Christophe Prieur
Theoretical Computer Science
327
(3), 2004, pp. 349-373
Minimizing finite automata is computationally hard
Andreas Malcher
Theoretical Computer Science
327
(3), 2004, pp. 375-390