Serge Grigorieff Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

22EEChristian 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)
21EEChristian Choffrut, Serge Grigorieff: The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata. Theor. Comput. Sci. 410(30-32): 2870-2884 (2009)
20EEMai Gehrke, Serge Grigorieff, Jean-Eric Pin: Duality and Equational Theory of Regular Languages. ICALP (2) 2008: 246-257
19EEMarie Ferbus-Zanda, Serge Grigorieff: Is Randomness "Native" to Computer Science? CoRR abs/0801.0289: (2008)
18EEMarie Ferbus-Zanda, Serge Grigorieff: Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity CoRR abs/0801.0349: (2008)
17EEMarie 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)
16EEMarie Ferbus-Zanda, Serge Grigorieff: Kolmogorov complexities Kmax, Kmin on computable partially ordered sets CoRR abs/0801.0351: (2008)
15EEMarie Ferbus-Zanda, Serge Grigorieff: Set theoretical Representations of Integers, I CoRR abs/0801.0353: (2008)
14EEMarie Ferbus-Zanda, Serge Grigorieff: Kolmogorov complexity in perspective CoRR abs/0801.0354: (2008)
13EEVerónica Becher, Serge Grigorieff: Random reals à la Chaitin with or without prefix-freeness. Theor. Comput. Sci. 385(1-3): 193-201 (2007)
12EEChristian Choffrut, Serge Grigorieff: Separability of rational relations in A* × Nm by recognizable relations is decidable. Inf. Process. Lett. 99(1): 27-32 (2006)
11EEMarie Ferbus-Zanda, Serge Grigorieff: Kolmogorov complexity and set theoretical representations of integers. Math. Log. Q. 52(4): 375-403 (2006)
10EEMarie Ferbus-Zanda, Serge Grigorieff: Kolmogorov complexities Kmax, Kmin on computable partially ordered sets. Theor. Comput. Sci. 352(1-3): 159-180 (2006)
9EESerge 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)
8EESerge Grigorieff, Maurice Margenstern: Register Cellular Automata in the Hyperbolic Plane. Fundam. Inform. 61(1): 19-27 (2004)
7EEVerónica Becher, Serge Grigorieff: Recursion and topology on 2<=omega for possibly infinite computations. Theor. Comput. Sci. 322(1): 85-136 (2004)
6EESerge Grigorieff, Jean-Yves Marion: Kolmogorov complexity and non-determinism. Theor. Comput. Sci. 271(1-2): 151-180 (2002)
5EESerge Grigorieff: Modelization of deterministic rational relations. Theor. Comput. Sci. 281(1-2): 423-453 (2002)
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)
2 Christian Choffrut, Serge Grigorieff: Uniformization of Rational Relations. Jewels are Forever 1999: 59-71
1 Serge Grigorieff: Every Recursive Linear Ordering Has a Copy in DTIME-SPACE(n, log(n)). J. Symb. Log. 55(1): 260-276 (1990)

Coauthor Index

1Verónica Becher [7] [13]
2Christian Choffrut [2] [12] [21] [22]
3Loïc Colson [3]
4Marie Ferbus-Zanda [4] [10] [11] [14] [15] [16] [17] [18] [19]
5Mai Gehrke [20]
6Maurice Margenstern [8]
7Jean-Yves Marion [6]
8Jean-Eric Pin [20]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)