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=328
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An optimal pre-determinization algorithm for weighted transducers
Cyril Allauzen
,
Mehryar Mohri
Theoretical Computer Science
328
(1-2), 2004, pp. 3-18
Conversation protocols: A formalism for specification and verification of reactive electronic services
Xiang Fu
,
Tevfik Bultan
,
Jianwen Su
Theoretical Computer Science
328
(1-2), 2004, pp. 19-37
Acyclic networks maximizing the printing complexity
Franck Guingne
,
Florent Nicart
,
André Kempe
Theoretical Computer Science
328
(1-2), 2004, pp. 39-51
Branching automata with costs - A way of reflecting parallelism in costs
Dietrich Kuske
,
Ingmar Meinecke
Theoretical Computer Science
328
(1-2), 2004, pp. 53-75
Introducing
Vaucanson
Sylvain Lombardy
,
Yann Régis-Gianas
,
Jacques Sakarovitch
Theoretical Computer Science
328
(1-2), 2004, pp. 77-96
Ternary directed acyclic word graphs
Satoru Miyamoto
,
Shunsuke Inenaga
,
Masayuki Takeda
,
Ayumi Shinohara
Theoretical Computer Science
328
(1-2), 2004, pp. 97-111
Weak minimization of DFA - An algorithm and applications
B. Ravikumar
,
G. Eisman
Theoretical Computer Science
328
(1-2), 2004, pp. 113-133
Bideterministic automata and minimal representations of regular languages
Hellis Tamm
,
Esko Ukkonen
Theoretical Computer Science
328
(1-2), 2004, pp. 135-149
Reducing the time complexity of testing for local threshold testability
A.N. Trahtman
Theoretical Computer Science
328
(1-2), 2004, pp. 151-160
On binary
\bigoplus
-NFAs and succinct descriptions of regular languages
Lynette van Zijl
Theoretical Computer Science
328
(1-2), 2004, pp. 161-170
A formal frame for robust parsing
M. Vilares
,
V.M. Darriba
,
J. Vilares
,
F.J. Ribadas
Theoretical Computer Science
328
(1-2), 2004, pp. 171-186
Reachability solution characterization of parametric real-time systems
Farn Wang
,
Hsu-Chun Yen
Theoretical Computer Science
328
(1-2), 2004, pp. 187-201
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Gaoyan Xie
,
Cheng Li
,
Zhe Dang
Theoretical Computer Science
328
(1-2), 2004, pp. 203-219
The probabilistic powerdomain for stably compact spaces
Mauricio Alvarez-Manilla
,
Achim Jung
,
Klaus Keimel
Theoretical Computer Science
328
(3), 2004, pp. 221-244
Structure and behavior preservation by Petri-net-based refinements in system design
Hejiao Huang
,
To-yat Cheung
,
Wai Ming Mak
Theoretical Computer Science
328
(3), 2004, pp. 245-269
Enhancing global SLS-resolution with loop cutting and tabling mechanisms
Yi-Dong Shen
,
Jia-Huai You
,
Li-Yan Yuan
Theoretical Computer Science
328
(3), 2004, pp. 271-287
Type inference for light affine logic via constraints on words
Patrick Baillot
Theoretical Computer Science
328
(3), 2004, pp. 289-323
Linearity and regularity with negation normal form
Reiner Hähnle
,
Neil V. Murray
,
Erik Rosenthal
Theoretical Computer Science
328
(3), 2004, pp. 325-354
A dynamical system which must be stable whose stability cannot be proved
John Foy
Theoretical Computer Science
328
(3), 2004, pp. 355-361