Maurice Nivat

Bull. dInformatique Approfondie et Appl., 2016

2015

The true story of TCS.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2012

40th Anniversary of EATCS.

[BibT_eX]

[DOI]

Bull. EATCS, 2012

2008

Scanning integer matrices by means of two rectangular windows.

[BibT_eX]

[DOI]

Andrea Frosini

Simone Rinaldi

Theor. Comput. Sci., 2008

In Memoriam Attila Kuba (1953-2006).

[BibT_eX]

[DOI]

Kees Joost Batenburg

Antal Nagy

Theor. Comput. Sci., 2008

Preface.

[BibT_eX]

[DOI]

Kees Joost Batenburg

Antal Nagy

Theor. Comput. Sci., 2008

Automata, tilings and tomography.

[BibT_eX]

Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

2007

Binary matrices under the microscope: A tomographical problem.

[BibT_eX]

[DOI]

Andrea Frosini

Theor. Comput. Sci., 2007

2005

A sufficient condition for non-uniqueness in binary tomography with absorption.

[BibT_eX]

[DOI]

Attila Kuba

Theor. Comput. Sci., 2005

An introduction to periodical discrete sets from a tomographical perspective.

[BibT_eX]

[DOI]

Andrea Frosini

Laurent Vuillon

Theor. Comput. Sci., 2005

Some necessary clarifications about the chords' problem and the Partial Digest Problem.

[BibT_eX]

[DOI]

Yan Gérard

Theor. Comput. Sci., 2005

2004

For the 50th anniversary of Eric Goles: A few words by Maurice Nivat.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On The Palindromic Complexity Of Infinite Words.

[BibT_eX]

[DOI]

Srecko Brlek

Sylvie Hamel

Christophe Reutenauer

Int. J. Found. Comput. Sci., 2004

A bijection for the total area of parallelogram polyominoes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

On a Tomographic Equivalence Between (0, 1)-Matrices.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2003

Foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.

[BibT_eX]

[DOI]

Yacine Boufkhad

Olivier Dubois

Theor. Comput. Sci., 2003

A codicity undecidable problem in the plane.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Salient and Reentrant Points of Discrete Sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

2002

The chords' problem.

[BibT_eX]

[DOI]

Yan Gérard

Theor. Comput. Sci., 2002

Discrete Tomography: Reconstruction under Periodicity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Reconstruction of Binary Matrices from Absorbed Projections.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 10th International Conference, 2002

2001

25 Years.

[BibT_eX]

Theor. Comput. Sci., 2001

Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

Medians of Discrete Sets according to a Linear Distance.

[BibT_eX]

[DOI]

Alberto Del Lungo

Discret. Comput. Geom., 2000

Reconstruction of Discrete Sets with Absorption.

[BibT_eX]

[DOI]

Attila Kuba

Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

Reconstruction of Discrete Sets from Three or More X-Rays.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1998

The Medians of Discrete Sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Medians of polyominoes: A property for reconstruction.

[BibT_eX]

[DOI]

Int. J. Imaging Syst. Technol., 1998

1997

Minimal Ascending and Descending Tree Automata.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

New Challenges for Theoretical Computer Science.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Reconstructing Digital Sets from X-Rays.

[BibT_eX]

[DOI]

Proceedings of the Image Analysis and Processing, 9th International Conference, 1997

1996

Reconstructing Convex Polyominoes from Horizontal and Vertical Projections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

The number of convex polyominoes reconstructible from their orthogonal projections.

[BibT_eX]

[DOI]

Alberto Del Lungo

Renzo Pinzani

Discret. Math., 1996

Reconstruction convex polyominoes from horizontal and vertical projections II.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 1996

1995

Tiling Figures of the Plane with Two Bars.

[BibT_eX]

[DOI]

Comput. Geom., 1995

Prefix and Period Languages of Rational <i>omega</i>-Languages.

[BibT_eX]

Hugues Calbrix

Proceedings of the Developments in Language Theory II, 1995

1994

Efficient Parallel Shuffle Recognition.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1994

Parallel Algorithms for Multi-Dimensional Image Template Matching.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 1994

Context-Sensitivity of Puzzle Grammars.

[BibT_eX]

[DOI]

P. Laroche

Int. J. Pattern Recognit. Artif. Intell., 1994

1993

The Effect of the Number of Successful Paths in a BüChi Tree Automaton.

[BibT_eX]

[DOI]

Damian Niwinski

Int. J. Algebra Comput., 1993

Another variation on the common subexpression problem.

[BibT_eX]

[DOI]

Discret. Math., 1993

Ultimately Periodic Words of Rational <i>w</i>-Languages.

[BibT_eX]

[DOI]

Hugues Calbrix

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992

Parallel Recognition of High Dimensional Images.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 1992

A note about minimal non-deterministic automata.

[BibT_eX]

Anne Dicky

Bull. EATCS, 1992

A Parallel Algorithm for Recognizing the Shuffle of Two Strings.

[BibT_eX]

[DOI]

Proceedings of the 6th International Parallel Processing Symposium, 1992

Optimal Parallel Algorithms for Multidimensional Image Template Matching and Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Parallel Image Analysis, Second International Conference, 1992

Binary tree codes.

[BibT_eX]

Proceedings of the Tree Automata and Languages., 1992

Suffix, prefix and maximal tree codes.

[BibT_eX]

Philippe Aigrain

Proceedings of the Tree Automata and Languages., 1992

1991

Langages algébriques de mots biinfinis.

[BibT_eX]

Françoise Gire

Theor. Comput. Sci., 1991

Puzzle Grammars and Context-Free Array Grammars.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 1991

On Translating One Polyomino to Tile the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1991

Parallel Recognition of Two-Dimensional Images.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1991

About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions.

[BibT_eX]

[DOI]

Damian Niwinski

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Parallélisation d'algorithmes avec un nombre fixe de processeurs.

[BibT_eX]

[DOI]

Carole Delporte-Gallet

Hugues Fauconnier

RAIRO Theor. Informatics Appl., 1990

Parallel generation of infinite images.

[BibT_eX]

[DOI]

V. Rajkumar Dare

Int. J. Comput. Math., 1990

Tiling the Plane with One Tile.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Automata on Infinite Objects and Their Applications to Logic and Programming

[BibT_eX]

[DOI]

Inf. Comput., October, 1989

Parallel Generation of Finite Images.

[BibT_eX]

[DOI]

V. Rajkumar Dare

Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Parallel Generation of Finite Images.

[BibT_eX]

[DOI]

V. Rajkumar Dare

Int. J. Pattern Recognit. Artif. Intell., 1989

Definite tree languages.

[BibT_eX]

Bull. EATCS, 1989

1988

Automata on infinite trees and Kleene closure of regular tree sets.

[BibT_eX]

Bull. EATCS, 1988

1985

About Rational Sets of Factors of a Bi-Infinite Word.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

1982

Efficient Recognition of Rational Relations.

[BibT_eX]

[DOI]

Jan van Leeuwen

Inf. Process. Lett., 1982

Ensembles Reconnaissables de Mots Biinfinis

[BibT_eX]

[DOI]

Dominique Perrin

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1981

The Rational Index: A Complexity Measure for Languages.

[BibT_eX]

[DOI]

Bruno Courcelle

SIAM J. Comput., 1981

Centers of Languages.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

Infinitary Relations.

[BibT_eX]

[DOI]

Proceedings of the CAAP '81, 1981

1980

Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

Formal Computations of Non Deterministic Recursive Program Schemes.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1980

Adherences of Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

The metric space of infinite trees. Algebraic and topological properties.

[BibT_eX]

Fundam. Informaticae, 1980

Rational Bijection of Rational Sets.

[BibT_eX]

[DOI]

Hermann A. Maurer

Acta Informatica, 1980

Controlling Behaviours of Systems: Some Basic Concepts and some Applications.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

Non Deterministic Programs: An Algebraic Overview.

[BibT_eX]

Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

1979

Quelques problèmes ouverts en théorie des langages algébriques.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1979

On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts.

[BibT_eX]

[DOI]

Guy Cousineau

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Bijective A-Transducers

[BibT_eX]

[DOI]

Hermann A. Maurer

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

Linear Languages and the Intersection Closures of Classes of Languages.

[BibT_eX]

[DOI]

Ronald V. Book

SIAM J. Comput., 1978

Sur les ensembles de mots infins engendrés par une grammaire algébrique.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1978

The Algebraic Semantics of Recursive Program Schemes.

[BibT_eX]

[DOI]

Bruno Courcelle

Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977

Le Cylindre des Langages Linéaires.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1977

Mots Infinis Engendrés par Une Grammaire Algébrique.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1977

Non Deterministic Recursive Program Schemes.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1976

Algebraic Families of Interpretations

[BibT_eX]

[DOI]

Bruno Courcelle

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

Parenthesis Generators

[BibT_eX]

[DOI]

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975

Le cylindre des langages linéaires n'est pas principal.

[BibT_eX]

[DOI]

Proceedings of the Automata Theory and Formal Languages, 1975

1974

Reversal-Bounded Acceptors and Intersections of Linear Languages.

[BibT_eX]

[DOI]

Ronald V. Book

Mike Paterson

SIAM J. Comput., 1974

Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract)

[BibT_eX]

[DOI]

Ronald V. Book

Mike Paterson

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1973

Sur diverses familles de langages fermées par transduction rationelle

[BibT_eX]

Acta Informatica, 1973

Familles de langages translatables et fermées par crochet

[BibT_eX]

J. P. Crestin

Acta Informatica, 1973

Operators on Families of Languages.

[BibT_eX]

Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972

Langages algébriques sur le magma libre et sémantique des schémas de programme.

[BibT_eX]

Proceedings of the Automata, 1972

1970

On Some Families of Languages Related to the Dyck Language

[BibT_eX]

[DOI]

Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

1968

Transduction des langages de Chomsky.

[BibT_eX]