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=366
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The category theoretic solution of recursive program schemes
Stefan Milius
,
Lawrence S. Moss
Theoretical Computer Science
366
(1-2), 2006, pp. 3-59
Bisimilarity is not finitely based over BPA with interrupt
Luca Aceto
,
Wan Fokkink
,
Anna Ingolfsdottir
,
Sumit Nain
Theoretical Computer Science
366
(1-2), 2006, pp. 60-81
The intersection of algebra and coalgebra
J. Adámek
Theoretical Computer Science
366
(1-2), 2006, pp. 82-97
A basic algebra of stateless connectors
Roberto Bruni
,
Ivan Lanese
,
Ugo Montanari
Theoretical Computer Science
366
(1-2), 2006, pp. 98-120
A coalgebraic approach to the semantics of the ambient calculus
Daniel Hausmann
,
Till Mossakowski
,
Lutz Schröder
Theoretical Computer Science
366
(1-2), 2006, pp. 121-143
Discrete Lawvere theories and computational effects
Martin Hyland
,
John Power
Theoretical Computer Science
366
(1-2), 2006, pp. 144-162
Complete symbolic reachability analysis using back-and-forth narrowing
Prasanna Thati
,
José Meseguer
Theoretical Computer Science
366
(1-2), 2006, pp. 163-179
Codes defined by multiple sets of trajectories
Michael Domaratzki
,
Kai Salomaa
Theoretical Computer Science
366
(3), 2006, pp. 182-193
Alternative proof of the Lyndon-Schützenberger theorem
Pál Dömösi
,
Géza Horváth
Theoretical Computer Science
366
(3), 2006, pp. 194-198
Skew and infinitary formal power series
Manfred Droste
,
Dietrich Kuske
Theoretical Computer Science
366
(3), 2006, pp. 199-227
Weighted tree automata and weighted logics
Manfred Droste
,
Heiko Vogler
Theoretical Computer Science
366
(3), 2006, pp. 228-247
Compositions of tree series transformations
Andreas Maletti
Theoretical Computer Science
366
(3), 2006, pp. 248-271
Marcus
t
-contextual grammars and cut hierarchies and monotonicity for restarting automata
F. Mráz
,
F. Otto
,
M. Plátek
,
T. Jurdziński
Theoretical Computer Science
366
(3), 2006, pp. 272-296
The finiteness of synchronous, tabled picture languages is decidable
Bianca Truthe
Theoretical Computer Science
366
(3), 2006, pp. 297-315