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=International Journal of Foundations of Computer Science AND Volume=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the non-deterministic communication complexity of regular languages
Anil Ada
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 479-493
The average state complexity of rational operations on finite languages
Frédérique Bassino
,
Laura Giambruno
,
Cyril Nicaud
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 495-516
Hierarchies of piecewise testable languages
Ondȓej Klíma
,
Libor Polák
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 517-533
Number of occurrences of powers in strings
Maxime Crochemore
,
Szilárd Zsolt Fazekas
,
Costas S. Iliopoulos
,
Inuka Jayasekera
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 535-547
Variants of competence-based derivations in CD grammar systems
Erzsébet Csuhaj-Varjú
,
Jürgen Dassow
,
György Vaszil
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 549-569
Tree automata with global constraints
Emmanuel Filiot
,
Jean-Marc Talbot
,
Sophie Tison
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 571-596
Finding the growth rate of a regular or context-free language in polynomial time
Paweƚ Gawrychowski
,
Dalia Krieger
,
Narad Rampersad
,
Jeffrey Shallit
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 597-618
A taxonomy of deterministic forgetting automata
Jens Glöckler
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 619-631
On the relation between periodicity and unbordered factors of finite words
S̑tȇpán Holub
,
Dirk Nowotka
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 633-645
Balance properties and distribution of squares in circular words
Roberto Mantaci
,
Sabrina Mantaci
,
Antonio Restivo
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 647-664
Unambiguous shared-memory systems
Rémi Morin
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 665-685
On the structure of finitely generated semigroups of unary regular languages
Sergey Afonin
,
Elena Khazova
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 689-704
Fine and Wilf's theorem for partial words with arbitrarily many weak periods
F. Blanchet-Sadri
,
Taktin Oey
,
Timothy D. Rankin
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 705-722
Generative capacity of subregularly tree controlled grammars
Jürgen Dassow
,
Ralf Stiebe
,
Bianca Truthe
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 723-740
Finite-memory automata with non-deterministic reassignment
Michael Kaminski
,
Daniel Zeitlin
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 741-760
Literally idempotent languages and their varieties - Two letter case
Ondȓej Klíma
,
Libor Polák
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 761-780
On stateless two-pushdown automata and restarting automata
Martin Kutrib
,
Hartmut Messerschmidt
,
Friedrich Otto
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 781-798
Boolean grammars and GSM mappings
Tommi Lehtinen
,
Alexander Okhotin
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 799-815
Compressed membership problems for regular expressions and hierarchical automata
Markus Lohrey
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 817-841
Sublinearly space bounded iterative arrays
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 843-858
Some remarks on the hairpin completion
Florin Manea
,
Victor Mitrana
,
Takashi Yokomori
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 859-872
One-space bounded algorithms for two-dimensional bin packing
Francis Y.L. Chin
,
Hing-Fung Ting
,
Yong Zhang
International Journal of Foundations of Computer Science
21
(6), 2010, pp. 875-891
PTAS for
k
-tour cover problem on the plane for moderately large values of
k
Anna Adamaszek
,
Artur Czumaj
,
Andrzej Lingas
International Journal of Foundations of Computer Science
21
(6), 2010, pp. 893-904
Computational complexity of the perfect matching problem in hypergraphs with subcritical density
Marek Karpiński
,
Andrzej Ruciński
,
Edyta Szymańska
International Journal of Foundations of Computer Science
21
(6), 2010, pp. 905-924
Finding all approximate gapped palindromes
Ping-Hui Hsu
,
Kuan-Yu Chen
,
Kun-Mao Chao
International Journal of Foundations of Computer Science
21
(6), 2010, pp. 925-939
Seiten
<
1
2
3
>