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=330
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Synchronizing generalized monotonic automata
D.S. Ananichev
,
M.V. Volkov
Theoretical Computer Science
330
(1), 2005, pp. 3-13
Regular frequency computations
Holger Austinat
,
Volker Diekert
,
Ulrich Hertrampf
,
Holger Petersen
Theoretical Computer Science
330
(1), 2005, pp. 15-21
Mergible states in large NFA
Cezar Câmpeanu
,
Nicolae Sântean
,
Sheng Yu
Theoretical Computer Science
330
(1), 2005, pp. 23-34
Completions in measure of languages and related combinatorial problems
Arturo Carpi
,
Aldo de Luca
Theoretical Computer Science
330
(1), 2005, pp. 35-57
On two-way nondeterministic finite automata with one reversal-bounded counter
Zhe Dang
,
Oscar H. Ibarra
,
Zhi-Wei Sun
Theoretical Computer Science
330
(1), 2005, pp. 59-79
A coding theory construction of new systematic authentication codes
Cunsheng Ding
,
Xuesong Wang
Theoretical Computer Science
330
(1), 2005, pp. 81-99
Tissue
P
systems with channel states
Rudolf Freund
,
Gheorghe Păun
,
Mario J. Pérez-Jiménez
Theoretical Computer Science
330
(1), 2005, pp. 101-116
On the equation
x^k=z^{k_1}_1z^{k_2}_2...z^{k_n}_n
in a free semigroup
Tero Harju
,
Dirk Nowotka
Theoretical Computer Science
330
(1), 2005, pp. 117-121
The language equivalence problem for HD0L systems having H0L growths
Juha Honkala
Theoretical Computer Science
330
(1), 2005, pp. 123-133
On the power of randomized multicounter machines
Juraj Hromkovic̑
,
Georg Schnitger
Theoretical Computer Science
330
(1), 2005, pp. 135-144
Decision problems for semi-Thue systems with a few rules
Yuri Matiyasevich
,
Géraud Sénizergues
Theoretical Computer Science
330
(1), 2005, pp. 145-169
Explicit test sets for iterated morphisms in free monoids and Metabelian groups
Keijo Ruohonen
Theoretical Computer Science
330
(1), 2005, pp. 171-191
On the number of components in cooperating distributed grammar systems
Henning Bordihn
Theoretical Computer Science
330
(2), 2005, pp. 195-204
On the size complexity of hybrid networks of evolutionary processors
Juan Castellanos
,
Peter Leupold
,
Victor Mitrana
Theoretical Computer Science
330
(2), 2005, pp. 205-220
Random generation of DFAs
Jean-Marc Champarnaud
,
Thomas Paranthoën
Theoretical Computer Science
330
(2), 2005, pp. 221-235
Template-guided DNA recombination
Mark Daley
,
Ian McQuillan
Theoretical Computer Science
330
(2), 2005, pp. 237-250
Computationally universal
P
systems without priorities: Two catalysts are sufficient
Rudolf Freund
,
Lila Kari
,
Marion Oswald
,
Petr Sosík
Theoretical Computer Science
330
(2), 2005, pp. 251-266
On the descriptional complexity of finite automata with modified acceptance conditions
Markus Holzer
,
Martin Kutrib
Theoretical Computer Science
330
(2), 2005, pp. 267-285
State complexity of some operations on binary regular languages
Galina Jirásková
Theoretical Computer Science
330
(2), 2005, pp. 287-298
Succinct representations of languages by DFA with different levels of reliability
Martin Kappes
,
Frank Nießner
Theoretical Computer Science
330
(2), 2005, pp. 299-310
On the descriptional power of heads, counters, and pebbles
Martin Kutrib
Theoretical Computer Science
330
(2), 2005, pp. 311-324
On two-way communication in cellular automata with a fixed number of cells
Andreas Malcher
Theoretical Computer Science
330
(2), 2005, pp. 325-338
Context-free insertion-deletion systems
Maurice Margenstern
,
Gheorghe Păun
,
Yurii Rogozhin
,
Sergey Verlan
Theoretical Computer Science
330
(2), 2005, pp. 339-348
Complementing unary nondeterministic automata
Filippo Mera
,
Giovanni Pighizzini
Theoretical Computer Science
330
(2), 2005, pp. 349-360
On the descriptional complexity of some rewriting mechanisms regulated by context conditions
György Vaszil
Theoretical Computer Science
330
(2), 2005, pp. 361-373
Seiten 1
2
>