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=410
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding compact structural motifs
Dongbo Bu
,
Ming Li
,
Shuai Cheng Li
,
Jianbo Qian
,
Jinbo Xu
Theoretical Computer Science
410
(30-32), 2009, pp. 2834-2839
Characteristic morphisms of generalized Episturmian words
Michelangelo Bucci
,
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
410
(30-32), 2009, pp. 2840-2859
A new characteristic property of rich words
Michelangelo Bucci
,
Alessandro De Luca
,
Amy Glen
,
Luca Q. Zamboni
Theoretical Computer Science
410
(30-32), 2009, pp. 2860-2863
A Sturmian sequence related to the uniqueness conjecture for Markoff numbers
Yann Bugeaud
,
Christophe Reutenauer
,
Samir Siksek
Theoretical Computer Science
410
(30-32), 2009, pp. 2864-2869
The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata
Christian Choffrut
,
Serge Grigorieff
Theoretical Computer Science
410
(30-32), 2009, pp. 2870-2884
Dejean's conjecture holds for
n\ge30
James Currie
,
Narad Rampersad
Theoretical Computer Science
410
(30-32), 2009, pp. 2885-2888
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
Elena Czeizler
,
Wojciech Plandowski
Theoretical Computer Science
410
(30-32), 2009, pp. 2889-2909
Some operations preserving primitivity of words
Jürgen Dassow
,
Gema M. Martín
,
Francisco J. Vico
Theoretical Computer Science
410
(30-32), 2009, pp. 2910-2919
On the satisfiability threshold of formulas with three literals per clause
J. Díaz
,
L. Kirousis
,
D. Mitsche
,
X. Pérez-Giménez
Theoretical Computer Science
410
(30-32), 2009, pp. 2920-2934
Some remarks about stabilizers
Volker Diekert
,
Dalia Krieger
Theoretical Computer Science
410
(30-32), 2009, pp. 2935-2946
Simple equations on binary factorial languages
A.E. Frid
Theoretical Computer Science
410
(30-32), 2009, pp. 2947-2956
On post correspondence problem for letter monotonic languages
Vesa Halava
,
Jarkko Kari
,
Yuri Matiyasevich
Theoretical Computer Science
410
(30-32), 2009, pp. 2957-2960
Nondeterministic state complexity of nested word automata
Yo-Sub Han
,
Kai Salomaa
Theoretical Computer Science
410
(30-32), 2009, pp. 2961-2971
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
Juraj Hromkovic̑
,
Holger Petersen
,
Georg Schnitger
Theoretical Computer Science
410
(30-32), 2009, pp. 2972-2981
Sequential SNP systems based on min/max spike number
Oscar H. Ibarra
,
Andrei Păun
,
Alfonso Rodríguez-Patón
Theoretical Computer Science
410
(30-32), 2009, pp. 2982-2991
Bio-PEPA: A framework for the modelling and analysis of biological systems
Federica Ciocchetta
,
Jane Hillston
Theoretical Computer Science
410
(33-34), 2009, pp. 3065-3084
An intermediate language for the stochastic simulation of biological systems
Roberto Barbuti
,
Giulio Caravagna
,
Andrea Maggiolo-Schettini
,
Paolo Milazzo
Theoretical Computer Science
410
(33-34), 2009, pp. 3085-3109
A Control Flow Analysis for Beta-binders with and without static compartments
Chiara Bodei
Theoretical Computer Science
410
(33-34), 2009, pp. 3110-3127
On algorithmic analysis of transcriptional regulation by LTL model checking
J. Barnat
,
L. Brim
,
I. C̑erná
,
S. Draz̑an
,
J. Fabriková
,
D. S̑afránek
Theoretical Computer Science
410
(33-34), 2009, pp. 3128-3148
Modeling and simulation of cardiac tissue using hybrid I/O automata
E. Bartocci
,
F. Corradini
,
M.R. Di Berardini
,
E. Entcheva
,
S.A. Smolka
,
R. Grosu
Theoretical Computer Science
410
(33-34), 2009, pp. 3149-3165
A process model of Rho GTP-binding proteins
Luca Cardelli
,
Emmanuelle Caron
,
Philippa Gardner
,
Ozan Kahramanoğulları
,
Andrew Phillips
Theoretical Computer Science
410
(33-34), 2009, pp. 3166-3185
On the size of computationally complete hybrid networks of evolutionary processors
Artiom Alhazov
,
Erzsébet Csuhaj-Varjú
,
Carlos Martín-Vide
,
Yurii Rogozhin
Theoretical Computer Science
410
(35), 2009, pp. 3188-3197
On the synchronized derivation depth of context-free grammars
Franziska Biegler
,
Kai Salomaa
Theoretical Computer Science
410
(35), 2009, pp. 3198-3208
Determination of finite automata accepting subregular languages
Henning Bordihn
,
Markus Holzer
,
Martin Kutrib
Theoretical Computer Science
410
(35), 2009, pp. 3209-3222
State-complexity hierarchies of uniform languages of alphabet-size length
Janusz Brzozowski
,
Stavros Konstantinidis
Theoretical Computer Science
410
(35), 2009, pp. 3223-3235
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>