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=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A pumping condition for ultralinear languages
Enzo Magalini
,
Giovanni Pighizzini
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1303-1312
On metalinear parallel communicating grammar systems
Andreas Malcher
,
Bettina Sunckel
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1313-1322
Decision problems on path-controlled grammars
Carlos Martín-Vide
,
Victor Mitrana
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1323-1332
Cooperating distributed systems of restarting automata
Hartmut Messerschmidt
,
Friedrich Otto
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1333-1342
Ambiguity by restarting automata
Frantis̑ek Mráz
,
Martin Plátek
,
Tomasz Jurdziński
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1343-1352
Membrane algorithm with Brownian subalgorithm and genetic subalgorithm
Taishin Y. Nishida
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1353-1360
Notes on dual concatenation
Alexander Okhotin
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1361-1370
Computing morphisms by spiking neural
P
systems
Gheorghe Păun
,
Mario J. Pérez-Jiménez
,
Grzegorz Rozenberg
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1371-1382
A tree-height hierarchy of context-free languages
Klaus Reinhardt
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1383-1394
Comparing subword occurrences in binary D0L sequences
Arto Salomaa
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1395-1406
State complexity of additive weighted finite automata
Kai Salomaa
,
Paul Schofield
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1407-1416
Prefix-free Łukasiewicz languages
Ludwig Staiger
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1417-1423
On competence in CD grammar systems with parallel rewriting
Maurice H. Ter Beek
,
Erzsébet Csuhaj-Varjú
,
Markus Holzer
,
György Vaszil
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1425-1439
SC-expressions in object-oriented languages
Sheng Yu
,
Qing Zhao
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1441-1452
Seiten
<
1
2
3
4