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=292
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Palindrome complexity
Jean-Paul Allouche
,
Michael Baake
,
Julien Cassaigne
,
David Damanik
Theoretical Computer Science
292
(1), 2003, pp. 9-31
A structural property of regular frequency computations
Holger Austinat
,
Volker Diekert
,
Ulrich Hertrampf
Theoretical Computer Science
292
(1), 2003, pp. 33-43
Squaring transducers: An efficient procedure for deciding functionality and sequentiality
Marie-Pierre Béal
,
Olivier Carton
,
Christophe Prieur
,
Jacques Sakarovitch
Theoretical Computer Science
292
(1), 2003, pp. 45-63
On probabilistic timed automata
Danièle Beauquier
Theoretical Computer Science
292
(1), 2003, pp. 65-84
On a valuation of rational subsets of
Z^k
- Dédié à Jean Berstel
Srec̑ko Brlek
,
Christoph Reutenauer
Theoretical Computer Science
292
(1), 2003, pp. 85-96
Cumulative defect
Véronique Bruyère
Theoretical Computer Science
292
(1), 2003, pp. 97-109
Semiperiodic words and root-conjugacy
Arturo Carpi
,
Aldo de Luca
Theoretical Computer Science
292
(1), 2003, pp. 111-130
Minimizing subsequential transducers: A survey
Christian Choffrut
Theoretical Computer Science
292
(1), 2003, pp. 131-143
PERT scheduling with convex cost functions
Philippe Chrétienne
,
Francis Sourd
Theoretical Computer Science
292
(1), 2003, pp. 145-164
Description trees and Tutte formulas
Robert Cori
,
Gilles Schaeffer
Theoretical Computer Science
292
(1), 2003, pp. 165-183
Reducing space for index implementation
Maxime Crochemore
Theoretical Computer Science
292
(1), 2003, pp. 185-197
Formal systems for gene assembly in ciliates
Andrzej Ehrenfeucht
,
Tero Harju
,
Ion Petre
,
David M. Prescott
,
Grzegorz Rozenberg
Theoretical Computer Science
292
(1), 2003, pp. 199-219
On-line digit set conversion in real base
Christiane Frougny
Theoretical Computer Science
292
(1), 2003, pp. 221-235
A defect theorem for bi-infinite words
Juhani Karhumäki
,
Ján Man̑uch
,
Wojciech Plandowski
Theoretical Computer Science
292
(1), 2003, pp. 237-243
On Fine and Wilf's theorem for bidimensional words
Filippo Mignosi
,
Antonio Restivo
,
Pedro V. Silva
Theoretical Computer Science
292
(1), 2003, pp. 245-262
Composition sequences for functions over a finite domain
Arto Salomaa
Theoretical Computer Science
292
(1), 2003, pp. 263-281
On some generalizations of the Thue-Morse morphism
Patrice Séébold
Theoretical Computer Science
292
(1), 2003, pp. 283-298
Uniform and nonuniform recognizability
Wolfgang Thomas
Theoretical Computer Science
292
(1), 2003, pp. 299-316
Algebraic tools for the concatenation product
Jean-Eric Pin
Theoretical Computer Science
292
(1), 2003, pp. 317-342
Formal logics of discovery and hypothesis formation by machine
Petr Hájek
,
Martin Holen̑a
Theoretical Computer Science
292
(2), 2003, pp. 345-357
Variants of iterative learning
Steffen Lange
,
Gunter Grieser
Theoretical Computer Science
292
(2), 2003, pp. 359-376
Uniform characterizations of polynomial-query learnabilities
Yosuke Hayashi
,
Satoshi Matsumoto
,
Ayumi Shinohara
,
Masayuki Takeda
Theoretical Computer Science
292
(2), 2003, pp. 377-385
Data abstractions for decision tree induction
Yoshimitsu Kudoh
,
Makoto Haraguchi
,
Yoshiaki Okubo
Theoretical Computer Science
292
(2), 2003, pp. 387-416
Iterative Bayes
João Gama
Theoretical Computer Science
292
(2), 2003, pp. 417-430
Smoothness prior approach to explore mean structure in large-scale time series
Genshiro Kitagawa
,
Tomoyuki Higuchi
,
Fumiyo N. Kondo
Theoretical Computer Science
292
(2), 2003, pp. 431-446
Seiten 1
2
>