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: Author="Choffrut, Christian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the decidability of the intersection problem for quantum automata and context-free languages
Alberto Bertoni
,
Christian Choffrut
,
Flavio D'Alessandro
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1065-1081
An algebraic characterization of unary two-way transducers
Christian Choffrut
,
Bruno Guillon
Lecture Notes in Computer Science
8634
, 2014, pp. 196-207
Rational relations having a rational trace on each finite intersection of rational relations
Christian Choffrut
,
Serge Grigorieff
Theoretical Computer Science
454
, 2012, pp. 88-94
First-order logics: Some characterizations and closure properties
Christian Choffrut
,
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
Acta Informatica
49
(4), 2012, pp. 225-248
The inclusion problem of context-free languages: Some tractable cases
Alberto Bertoni
,
Christian Choffrut
,
Roberto Radicioni
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 289-299
Unique decipherability in the monoid of languages: An application of rational relations
Christian Choffrut
,
Juhani Karhumäki
Theory of Computing Systems
49
(2), 2011, pp. 355-364
On bounded rational trace languages
Christian Choffrut
,
Flavio D'Alessandro
,
Stefano Varricchio
Theory of Computing Systems
46
(2), 2010, pp. 351-369
Finite
n
-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Christian Choffrut
,
Serge Grigorieff
Theoretical Computer Science
410
(1), 2009, pp. 16-34
The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata
Christian Choffrut
,
Serge Grigorieff
Theoretical Computer Science
410
(30-32), 2009, pp. 2870-2884
On the separability of sparse context-free languages and of bounded rational relations
Christian Choffrut
,
Flavio D'Alessandro
,
Stefano Varricchio
Theoretical Computer Science
381
(1-3), 2007, pp. 274-279
Local limit properties for pattern statistics and rational models
Alberto Bertoni
,
Christian Choffrut
,
Massimiliano Goldwurm
,
Violetta Lonati
Theory of Computing Systems
39
(1), 2006, pp. 209-235
Separability of rational relations in
A^* \times N^m
by recognizable relations is decidable
Christian Choffrut
,
Serge Grigorieff
Information Processing Letters
99
(1), 2006, pp. 27-32
Collage of two-dimensional words
Christian Choffrut
,
Berke Durak
Theoretical Computer Science
340
(2), 2005, pp. 364-380
Local limit distributions in pattern statistics: Beyond the Markovian models
Alberto Bertoni
,
Christian Choffrut
,
Massimiliano Goldwurm
,
Violetta Lonati
Lecture Notes in Computer Science
2996
, 2004, pp. 117-128
On the number of occurrences of a symbol in words of regular languages
Alberto Bertoni
,
Christian Choffrut
,
Massimiliano Goldwurm
,
Violetta Lonati
Theoretical Computer Science
302
(1-3), 2003, pp. 431-456
Minimizing subsequential transducers: A survey
Christian Choffrut
Theoretical Computer Science
292
(1), 2003, pp. 131-143
The commutation of finite sets: A challenging problem
Christian Choffrut
,
Juhani Karhumäki
,
Nicolas Ollinger
Theoretical Computer Science
273
(1-2), 2002, pp. 69-79
Distances between languages and reflexivity of relations
Christian Choffrut
,
Giovanni Pighizzini
Theoretical Computer Science
286
(1), 2002, pp. 117-138
Long words: The theory of concatenation and
\omega
-power
Stepehn L. Bloom
,
Christian Choffrut
Theoretical Computer Science
259
(1-2), 2001, pp. 533-548
Commutativity in free inverse monoids
Christian Choffrut
,
Flavio D'Alessandro
Theoretical Computer Science
204
(1-2), 1998, pp. 35-54
Equations in transfinite strings
Christian Choffrut
,
Sandor Horvath
Lecture Notes in Computer Science
1450
, 1998, pp. 656-664
Generalized rational relations and their logical difinability
Christian Choffrut
,
Leucio Guerra
Lecture Notes in Computer Science
1279
, 1997, pp. 138-149
Distances between languages and reflexivity of relations
Christian Choffrut
,
Giovanni Pighizzini
Lecture Notes in Computer Science
1295
, 1997, pp. 199-208
Conjugacy in free inverse monoids
Christian Choffrut
International Journal of Algebra and Computation
3
(2), 1993, pp. 169-188
On the starheight of some rational subsets closed under partial commutations
Christian Choffrut
Information and Computation
106
(1), 1993, September, pp. 61-82
Seiten 1
2
>