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=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Languages versus
\omega
-languages in regular infinite games
Namitand Chaturvedi
,
Jörg Olschiewski
,
Wolfgang Thomas
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 985-1000
Group extensions over infinite words
Volker Diekert
,
Alexei Myasnikov
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1001-1019
Abelian primitive words
Michael Domaratzki
,
Narad Rampersad
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1021-1033
Enumeration and decidable properties of automatic sequences
Émilie Charlier
,
Narad Rampersad
,
Jeffreu Shallit
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1035-1066
Almost rich words as morphic images of rich words
Edita Pelantová
,
S̑tépán Starosta
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1067-1083
State complexity and approximation
Yuan Gao
,
Sheng Yu
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1085-1098
Quantum counter automata
A.C. Cem Say
,
Abuzer Yakaryilmaz
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1099-1116
Some languages recognized by two-way finite automata with quantum and classical states
Shenggen Zheng
,
Daowen Qiu
,
Lvzhou Li
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1117-1129
The physical Church-Turing thesis and the principles of quantum theory
Pablo Arrighi
,
Gilles Dowek
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1131-1145
Minimum local disk cover sets for broadcasting in heterogeneous multihop wireless networks
Guaning Chen
,
Chih-Wei Yi
,
Min-Te Sun
,
Fang-Chu Liu
,
Wei-Chi Lan
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1147-1172
Stability and chaos in reaction systems
Andrzej Ehrenfeucht
,
Michael Main
,
Grzegorz Rozenberg
,
Allison Thompson Brown
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1173-1184
Algorithmic combinatorics on partial words
F. Blanchet-Sadri
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1189-1206
Unweighted and weighted hyper-minimization
Andreas Maletti
,
Daniel Quernheim
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1207-1225
Equational descriptions of languages
Jean-Éric Pin
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1227-1240
Channel synthesis for finite transducers
Gilles Benattar
,
Béatrice Bérard
,
Didier Lime
,
John Mullins
,
Olivier H. Roux
,
Mathieu Sassolas
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1241-1260
Quotient complexity of star-free languages
Janusz Brzozowski
,
Bo Liu
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1261-1276
On non-primitive palindromic context-free languages
Szilárd Zsolt Fazekas
,
Peter Leupold
,
Kayoko Shikishima-Tsuji
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1277-1289
Characterizations of bounded semilinear languages by one-way and two-way deterministic machines
Oscar H. Ibarra
,
Shinnosuke Seki
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1291-1305
de Bruijn sequences revisited
Lila Kari
,
Zhi Xu
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1307-1321
Around dot-depth one
Manfred Kufleitner
,
Alexander Lauser
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1323-1339
Probing high-capacity peers to reduce download times in P2P file sharing systems with stochastic service capacities
Keqin Li
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1341-1369
Identifying all Abelian periods of a string in quadratic time and relevant problems
Michalis Christou
,
Maxime Chrochemore
,
Costas S. Iliopoulos
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1371-1384
Large simple binary equality words
Jana Hadravová
,
S̑tȇpán Holoub
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1385-1403
Testing for forbidden posets in ordered rooted forests
Orly Yahalom
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1405-1417
On small universal splicing systems
Artiom Alhazov
,
Yurii Rogozhin
,
Sergey Verlan
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1423-1438
Seiten
<
1
2
3
4
>