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: Author="Czeizler, Elena"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An extension of the Lyndon-Schützenberger result to pseudoperiodic words
Elena Czeizler
,
Eugen Czeizler
,
Lila Kari
,
Shinnosuke Seki
Information and Computation
209
(4), 2011, pp. 717-730
On a special class of primitive words
Elena Czeizler
,
Lila Kari
,
Shinnosuke Seki
Theoretical Computer Science
411
(3), 2010, pp. 617-630
On the descriptional complexity of Watson-Crick automata
Elena Czeizler
,
Eugen Czeizler
,
Lila Kari
,
Kai Salomaa
Theoretical Computer Science
410
(35), 2009, pp. 3250-3260
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
Elena Czeizler
,
Wojciech Plandowski
Theoretical Computer Science
410
(30-32), 2009, pp. 2889-2909
On a special class of primitive words
Elena Czeizler
,
Lila Kari
,
Shinnosuke Seki
Lecture Notes in Computer Science
5162
, 2008, pp. 265-277
Multiple constraints on three and four words
Elena Czeizler
Theoretical Computer Science
391
(1-2), 2008, pp. 14-19
Intricacies of simple word equations: An example
Elena Czeizler
,
S̑tȇpán Holub
,
Juhani Karhumäki
,
Markku Laine
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1167-1175
On non-periodic solutions of independent systems of word equations over three unknowns
Elena Czeizler
,
Juhani Karhumäki
International Journal of Foundations of Computer Science
18
(4), 2007, pp. 873-897
On the power of parallel communicating Watson-Crick automata systems
Elena Czeizler
,
Eugen Czeizler
Theoretical Computer Science
358
(1), 2006, pp. 142-147
The non-parametrizability of the word equation
xyz=zvx
: A short proof
Elena Czeizler
Theoretical Computer Science
345
(2-3), 2005, pp. 296-303