| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Serge Grigorieff, Pierre Valarcher |
Evolving MultiAlgebras unify all usual sequential computation models  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
ASMs and Operational Algorithmic Completeness of Lambda Calculus |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mai Gehrke, Serge Grigorieff, Jean-Eric Pin |
A Topological Approach to Recognition. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Grigorieff, Pierre Valarcher |
Evolving Multialgebras Unify All Usual Sequential Computation Models. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
ASMs and Operational Algorithmic Completeness of Lambda Calculus. |
Fields of Logic and Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Verónica Becher, Serge Grigorieff |
From index sets to randomness in EMPTY SET n: random reals and possibly infinite computations. Part II. |
J. Symb. Log. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
Kolmogorov complexity in perspective |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
Is Randomness "Native" to Computer Science? |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
Set theoretical Representations of Integers, I |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Mai Gehrke, Serge Grigorieff, Jean-Eric Pin |
Duality and Equational Theory of Regular Languages. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Verónica Becher, Serge Grigorieff |
Random reals à la Chaitin with or without prefix-freeness. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
Kolmogorov complexity and set theoretical representations of integers. |
Math. Log. Q. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
Separability of rational relations in A* × Nm by recognizable relations is decidable. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Grigorieff |
Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(logm D). |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Carton, Christian Choffrut, Serge Grigorieff |
Decision problems among the main subfamilies of rational relations. |
ITA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Verónica Becher, Santiago Figueira, Serge Grigorieff, Joseph S. Miller |
Randomness and halting probabilities. |
J. Symb. Log. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Verónica Becher, Serge Grigorieff |
Random reals and possibly infinite computations Part I: Randomness in EMPTY SET '. |
J. Symb. Log. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Verónica Becher, Serge Grigorieff |
Recursion and topology on 2<=omega for possibly infinite computations. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Grigorieff, Maurice Margenstern |
Register Cellular Automata in the Hyperbolic Plane. |
Fundam. Inform. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Serge Grigorieff, Jean-Yves Marion |
Kolmogorov complexity and non-determinism. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Grigorieff |
Modelization of deterministic rational relations. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Loïc Colson, Serge Grigorieff |
Syntactical Truth Predicates For Second Order Arithmetic. |
J. Symb. Log. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Marie Ferbus-Zanda, Serge Grigorieff |
Is Randomness "Native" to Computer Science? |
Bulletin of the EATCS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
The Theory of Rational Relations on Transfinite Strings. |
Words, Languages & Combinatorics |
2000 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
Uniformization of Rational Relations. |
Jewels are Forever |
1999 |
DBLP BibTeX RDF |
|
| 1 | Serge Grigorieff |
Every Recursive Linear Ordering Has a Copy in DTIME-SPACE(n, log(n)). |
J. Symb. Log. |
1990 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")