Maurice Nivat

According to our database1, Maurice Nivat authored at least 96 papers between 1968 and 2015.

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2015
The true story of TCS.
Theor. Comput. Sci., 2015

2012
40th Anniversary of EATCS.
Bulletin of the EATCS, 2012

2008
Scanning integer matrices by means of two rectangular windows.
Theor. Comput. Sci., 2008

In Memoriam Attila Kuba (1953-2006).
Theor. Comput. Sci., 2008

Preface.
Theor. Comput. Sci., 2008

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

2007
Binary matrices under the microscope: A tomographical problem.
Theor. Comput. Sci., 2007

2005
A sufficient condition for non-uniqueness in binary tomography with absorption.
Theor. Comput. Sci., 2005

An introduction to periodical discrete sets from a tomographical perspective.
Theor. Comput. Sci., 2005

Some necessary clarifications about the chords' problem and the Partial Digest Problem.
Theor. Comput. Sci., 2005

Salient and reentrant points of discrete sets.
Discrete Applied Mathematics, 2005

2004
For the 50th anniversary of Eric Goles: A few words by Maurice Nivat.
Theor. Comput. Sci., 2004

On The Palindromic Complexity Of Infinite Words.
Int. J. Found. Comput. Sci., 2004

A bijection for the total area of parallelogram polyominoes.
Discrete Applied Mathematics, 2004

Binary Matrices Under the Microscope: A Tomographical Problem.
Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

On a Tomographic Equivalence Between (0, 1)-Matrices.
Proceedings of the Theory Is Forever, 2004

2003
Foreword.
Theor. Comput. Sci., 2003

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

A codicity undecidable problem in the plane.
Theor. Comput. Sci., 2003

Salient and Reentrant Points of Discrete Sets.
Electronic Notes in Discrete Mathematics, 2003

2002
The chords' problem.
Theor. Comput. Sci., 2002

Discrete Tomography: Reconstruction under Periodicity Constraints.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Reconstruction of Binary Matrices from Absorbed Projections.
Proceedings of the Discrete Geometry for Computer Imagery, 10th International Conference, 2002

2001
25 Years.
Theor. Comput. Sci., 2001

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

2000
Medians of Discrete Sets according to a Linear Distance.
Discrete & Computational Geometry, 2000

Reconstruction of Discrete Sets with Absorption.
Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

Reconstruction of Discrete Sets from Three or More X-Rays.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1998
The Medians of Discrete Sets.
Inf. Process. Lett., 1998

Medians of polyominoes: A property for reconstruction.
Int. J. Imaging Systems and Technology, 1998

1997
Minimal Ascending and Descending Tree Automata.
SIAM J. Comput., 1997

New Challenges for Theoretical Computer Science.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Reconstructing Digital Sets from X-Rays.
Proceedings of the Image Analysis and Processing, 9th International Conference, 1997

1996
Reconstructing Convex Polyominoes from Horizontal and Vertical Projections.
Theor. Comput. Sci., 1996

The number of convex polyominoes reconstructible from their orthogonal projections.
Discrete Mathematics, 1996

Reconstruction convex polyominoes from horizontal and vertical projections II.
Proceedings of the Discrete Geometry for Computer Imagery, 1996

1995
Tiling Figures of the Plane with Two Bars.
Comput. Geom., 1995

Prefix and Period Languages of Rational omega-Languages.
Proceedings of the Developments in Language Theory II, 1995

1994
Efficient Parallel Shuffle Recognition.
Parallel Processing Letters, 1994

Parallel Algorithms for Multi-Dimensional Image Template Matching.
IJPRAI, 1994

Context-Sensitivity of Puzzle Grammars.
IJPRAI, 1994

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

Another variation on the common subexpression problem.
Discrete Mathematics, 1993

Ultimately Periodic Words of Rational w-Languages.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992
Parallel Recognition of High Dimensional Images.
IJPRAI, 1992

A note about minimal non-deterministic automata.
Bulletin of the EATCS, 1992

A Parallel Algorithm for Recognizing the Shuffle of Two Strings.
Proceedings of the 6th International Parallel Processing Symposium, 1992

Optimal Parallel Algorithms for Multidimensional Image Template Matching and Pattern Matching.
Proceedings of the Parallel Image Analysis, Second International Conference, 1992

Context-Sensitivity of Puzzle Grammars.
Proceedings of the Parallel Image Analysis, Second International Conference, 1992

Binary tree codes.
Tree Automata and Languages, 1992

Suffix, prefix and maximal tree codes.
Tree Automata and Languages, 1992

1991
Langages algébriques de mots biinfinis.
Theor. Comput. Sci., 1991

Puzzle Grammars and Context-Free Array Grammars.
IJPRAI, 1991

On Translating One Polyomino to Tile the Plane.
Discrete & Computational Geometry, 1991

Parallel Recognition of Two-Dimensional Images.
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.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

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

Tiling the Plane with One Tile.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Automata on Infinite Objects and Their Applications to Logic and Programming
Inf. Comput., October, 1989

Parallel Generation of Finite Images.
Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Parallel Generation of Finite Images.
IJPRAI, 1989

Definite tree languages.
Bulletin of the EATCS, 1989

1988
Automata on infinite trees and Kleene closure of regular tree sets.
Bulletin of the EATCS, 1988

1985
About Rational Sets of Factors of a Bi-Infinite Word.
Proceedings of the Automata, 1985

1982
Efficient Recognition of Rational Relations.
Inf. Process. Lett., 1982

Ensembles Reconnaissables de Mots Biinfinis
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1981
The Rational Index: A Complexity Measure for Languages.
SIAM J. Comput., 1981

Centers of Languages.
Proceedings of the Theoretical Computer Science, 1981

Infinitary Relations.
Proceedings of the CAAP '81, 1981

1980
Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs.
Theor. Comput. Sci., 1980

Formal Computations of Non Deterministic Recursive Program Schemes.
Mathematical Systems Theory, 1980

Adherences of Languages.
J. Comput. Syst. Sci., 1980

The metric space of infinite trees. Algebraic and topological properties.
Fundam. Inform., 1980

Rational Bijection of Rational Sets.
Acta Inf., 1980

Controlling Behaviours of Systems: Some Basic Concepts and some Applications.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

Non Deterministic Programs: An Algebraic Overview.
IFIP Congress, 1980

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

On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Bijective A-Transducers
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
Linear Languages and the Intersection Closures of Classes of Languages.
SIAM J. Comput., 1978

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

The Algebraic Semantics of Recursive Program Schemes.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
Le Cylindre des Langages Linéaires.
Mathematical Systems Theory, 1977

Mots Infinis Engendrés par Une Grammaire Algébrique.
ITA, 1977

Non Deterministic Recursive Program Schemes.
FCT, 1977

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

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

1975
Le cylindre des langages linéaires n'est pas principal.
Proceedings of the Automata Theory and Formal Languages, 1975

1974
Reversal-Bounded Acceptors and Intersections of Linear Languages.
SIAM J. Comput., 1974

Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract)
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1973
Sur diverses familles de langages fermées par transductions rationelle
Acta Inf., 1973

Familles de langages translatables et fermées par crochet
Acta Inf., 1973

Operators on Families of Languages.
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.
ICALP, 1972

1970
On Some Families of Languages Related to the Dyck Language
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

1968
Transduction des langages de Chomsky.
PhD thesis, 1968


  Loading...