| 2009 |
|---|
| 21 | EE | Christian Choffrut,
Serge Grigorieff:
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Theor. Comput. Sci. 410(1): 16-34 (2009) |
| 2008 |
|---|
| 20 | EE | Mai Gehrke,
Serge Grigorieff,
Jean-Eric Pin:
Duality and Equational Theory of Regular Languages.
ICALP (2) 2008: 246-257 |
| 19 | EE | Marie Ferbus-Zanda,
Serge Grigorieff:
Is Randomness "Native" to Computer Science?
CoRR abs/0801.0289: (2008) |
| 18 | EE | Marie Ferbus-Zanda,
Serge Grigorieff:
Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity
CoRR abs/0801.0349: (2008) |
| 17 | EE | Marie Ferbus-Zanda,
Serge Grigorieff:
Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities
CoRR abs/0801.0350: (2008) |
| 16 | EE | Marie Ferbus-Zanda,
Serge Grigorieff:
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets
CoRR abs/0801.0351: (2008) |
| 15 | EE | Marie Ferbus-Zanda,
Serge Grigorieff:
Set theoretical Representations of Integers, I
CoRR abs/0801.0353: (2008) |
| 14 | EE | Marie Ferbus-Zanda,
Serge Grigorieff:
Kolmogorov complexity in perspective
CoRR abs/0801.0354: (2008) |
| 2007 |
|---|
| 13 | EE | Verónica Becher,
Serge Grigorieff:
Random reals à la Chaitin with or without prefix-freeness.
Theor. Comput. Sci. 385(1-3): 193-201 (2007) |
| 2006 |
|---|
| 12 | EE | Christian Choffrut,
Serge Grigorieff:
Separability of rational relations in A* × Nm by recognizable relations is decidable.
Inf. Process. Lett. 99(1): 27-32 (2006) |
| 11 | EE | Marie Ferbus-Zanda,
Serge Grigorieff:
Kolmogorov complexity and set theoretical representations of integers.
Math. Log. Q. 52(4): 375-403 (2006) |
| 10 | EE | Marie Ferbus-Zanda,
Serge Grigorieff:
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets.
Theor. Comput. Sci. 352(1-3): 159-180 (2006) |
| 9 | EE | Serge Grigorieff:
Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(logm D).
Theor. Comput. Sci. 356(1-2): 170-185 (2006) |
| 2004 |
|---|
| 8 | EE | Serge Grigorieff,
Maurice Margenstern:
Register Cellular Automata in the Hyperbolic Plane.
Fundam. Inform. 61(1): 19-27 (2004) |
| 7 | EE | Verónica Becher,
Serge Grigorieff:
Recursion and topology on 2<=omega for possibly infinite computations.
Theor. Comput. Sci. 322(1): 85-136 (2004) |
| 2002 |
|---|
| 6 | EE | Serge Grigorieff,
Jean-Yves Marion:
Kolmogorov complexity and non-determinism.
Theor. Comput. Sci. 271(1-2): 151-180 (2002) |
| 5 | EE | Serge Grigorieff:
Modelization of deterministic rational relations.
Theor. Comput. Sci. 281(1-2): 423-453 (2002) |
| 2001 |
|---|
| 4 | | Marie Ferbus-Zanda,
Serge Grigorieff:
Is Randomness "Native" to Computer Science?
Bulletin of the EATCS 74: 78-118 (2001) |
| 3 | | Loïc Colson,
Serge Grigorieff:
Syntactical Truth Predicates For Second Order Arithmetic.
J. Symb. Log. 66(1): 225-256 (2001) |
| 1999 |
|---|
| 2 | | Christian Choffrut,
Serge Grigorieff:
Uniformization of Rational Relations.
Jewels are Forever 1999: 59-71 |
| 1990 |
|---|
| 1 | | Serge Grigorieff:
Every Recursive Linear Ordering Has a Copy in DTIME-SPACE(n, log(n)).
J. Symb. Log. 55(1): 260-276 (1990) |
