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
[1]
Hilfe
Suche: Journal=International Journal of Foundations of Computer Science AND YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An automata approach to match gapped sequence tags against protein database
Yonghua Han
,
Bin Ma
,
Kaizhong Zhang
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 487-497
The generalization of generalized automata: Expression automata
Yo-Sub Han
,
Derick Wood
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 499-510
State complexity of concatenation and complementation
Jozef Jirásek
,
Galina Jirásková
,
Alexander Szabari
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 511-529
Operations on trajectories with applications to coding and bioinformatics
Lila Kari
,
Stavros Konstantinidis
,
Petr Sosík
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 531-546
State complexity and the monoid of transformations of a finite set
Bryan Krawetz
,
John Lawrence
,
Jeffrey Shallit
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 547-563
Approximating dependency grammars through intersection of star-free regular languages
Anssi Yli-Jyrä
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 565-579
Online scheduling of unit jobs with bounded importance ratio
Stanley P.Y. Fung
,
Francis Y.L. Chin
,
Hong Shen
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 581-598
Cascading random walks
K. Subramani
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 599-622
The dot-depth and the polynomial hierarchies correspond on the Delta levels
Bernd Borchert
,
Klaus-Jörn Lange
,
Frank Stephan
,
Pascal Tesson
,
Denis Thérien
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 625-644
Language families defined by a ciliate bio-operation: Hierarchies and decision problems
Jürgen Dassow
,
Markus Holzer
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 645-662
P
systems working in the sequential mode on arrays and strings
Rudolf Freund
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 663-682
On various notions of parallelism in
P
systems
Oscar H. Ibarra
,
Hsu-Chun Yen
,
Zhe Dang
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 683-705
Decidability and complexity in automatic monoids
Markus Lohrey
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 707-722
Relating tree series transducers and weighted tree automata
Andreas Maletti
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 723-741
An
NP
-complete fragment of LTL
Anca Muscholl
,
Igor Walukiewicz
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 743-753
Words avoiding
\frac{7}{3}
-powers and the Thue-Morse morphism
Narad Rampersad
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 755-766
Complementation of rational sets on countable scattered linear orderings
Chloé Rispal
,
Olivier Carton
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 767-786
Infinite iterated function systems in Cantor space and the Hausdorff measure of
\omega
-power languages
Ludwig Staiger
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 787-802
Partitioning trees of supply and demand
Takehiro Ito
,
Xiao Zhou
,
Takao Nishizeki
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 803-827
Representation of semiautomata by canonical words and equivalences
Janusz Brzozowski
,
Helmut Jürgensen
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 831-850
Cover transducers for functions with finite domain
Jean-Marc Champarnaud
,
Franck Guingne
,
Georges Hansel
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 851-865
On one-membrane
P
systems operating in sequential mode
Zhe Dang
,
Oscar H. Ibarra
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 867-881
Non-uniqueness and radius of cyclic unary NFAs
Michael Domaratzki
,
Keith Ellul
,
Jeffrey Shallit
,
Ming-Wei Wang
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 883-896
Restricted sets of trajectories and decidability of shuffle decompositions
Michael Domaratzki
,
Kai Salomaa
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 897-912
Advice for semifeasible sets and the complexity-theoretic cost (lessness) of algebraic properties
Piotr Faliszewski
,
Lane A. Hemaspaandra
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 913-928
Seiten
<
1
2
3
>