The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maurice Nivat: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luc Boasson, Maurice Nivat
    Le cylindre des langages linéaires n'est pas principal. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:16-19 [Conf]
  2. Maurice Nivat
    On a Tomographic Equivalence Between (0, 1)-Matrices. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:216-234 [Conf]
  3. Maurice Nivat
    Infinitary Relations. [Citation Graph (0, 0)][DBLP]
    CAAP, 1981, pp:46-75 [Conf]
  4. Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat
    Reconstruction of Discrete Sets from Three or More X-Rays. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:199-210 [Conf]
  5. Danièle Beauquier, Maurice Nivat
    Tiling the Plane with One Tile. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:128-138 [Conf]
  6. Emese Balogh, Attila Kuba, Alberto Del Lungo, Maurice Nivat
    Reconstruction of Binary Matrices from Absorbed Projections. [Citation Graph (0, 0)][DBLP]
    DGCI, 2002, pp:392-403 [Conf]
  7. Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani
    Reconstruction convex polyominoes from horizontal and vertical projections II. [Citation Graph (0, 0)][DBLP]
    DGCI, 1996, pp:295-306 [Conf]
  8. Attila Kuba, Maurice Nivat
    Reconstruction of Discrete Sets with Absorption. [Citation Graph (0, 0)][DBLP]
    DGCI, 2000, pp:137-148 [Conf]
  9. Hugues Calbrix, Maurice Nivat
    Prefix and Period Languages of Rational omega-Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:341-349 [Conf]
  10. Danièle Beauquier, Maurice Nivat, Damian Niwinski
    About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:136-145 [Conf]
  11. André Arnold, Maurice Nivat
    Non Deterministic Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:12-21 [Conf]
  12. Luc Boasson, Maurice Nivat
    Parenthesis Generators [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:253-257 [Conf]
  13. Bruno Courcelle, Maurice Nivat
    Algebraic Families of Interpretations [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:137-146 [Conf]
  14. Hermann A. Maurer, Maurice Nivat
    Bijective A-Transducers [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:97-100 [Conf]
  15. Danièle Beauquier, Maurice Nivat
    About Rational Sets of Factors of a Bi-Infinite Word. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:33-42 [Conf]
  16. Alberto Del Lungo, Andrea Frosini, Maurice Nivat, Laurent Vuillon
    Discrete Tomography: Reconstruction under Periodicity Constraints. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:38-56 [Conf]
  17. Maurice Nivat
    Langages algébriques sur le magma libre et sémantique des schémas de programme. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:293-308 [Conf]
  18. Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, A. Zurli
    Reconstructing Digital Sets from X-Rays. [Citation Graph (0, 0)][DBLP]
    ICIAP (1), 1997, pp:166-173 [Conf]
  19. P. Laroche, Maurice Nivat, Ahmed Saoudi
    Context-Sensitivity of Puzzle Grammars. [Citation Graph (0, 0)][DBLP]
    ICPIA, 1992, pp:195-212 [Conf]
  20. Ahmed Saoudi, Maurice Nivat
    Optimal Parallel Algorithms for Multidimensional Image Template Matching and Pattern Matching. [Citation Graph (0, 0)][DBLP]
    ICPIA, 1992, pp:240-246 [Conf]
  21. Maurice Nivat, Ahmed Saoudi
    Parallel Recognition of Two-Dimensional Images. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:326-327 [Conf]
  22. Maurice Nivat
    Non Deterministic Programs: An Algebraic Overview. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1980, pp:17-28 [Conf]
  23. Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar
    A Parallel Algorithm for Recognizing the Shuffle of Two Strings. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:112-115 [Conf]
  24. Andrea Frosini, Maurice Nivat
    Binary Matrices Under the Microscope: A Tomographical Problem. [Citation Graph (0, 0)][DBLP]
    IWCIA, 2004, pp:1-22 [Conf]
  25. André Arnold, Maurice Nivat
    Controlling Behaviours of Systems: Some Basic Concepts and some Applications. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:113-122 [Conf]
  26. Bruno Courcelle, Maurice Nivat
    The Algebraic Semantics of Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1978, pp:16-30 [Conf]
  27. Guy Cousineau, Maurice Nivat
    On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts. [Citation Graph (0, 0)][DBLP]
    MFCS, 1979, pp:567-580 [Conf]
  28. Maurice Nivat
    Operators on Families of Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:119-124 [Conf]
  29. Hugues Calbrix, Maurice Nivat, Andreas Podelski
    Ultimately Periodic Words of Rational w-Languages. [Citation Graph (0, 0)][DBLP]
    MFPS, 1993, pp:554-566 [Conf]
  30. Ronald V. Book, Maurice Nivat, Mike Paterson
    Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:290-296 [Conf]
  31. Maurice Nivat
    On Some Families of Languages Related to the Dyck Language [Citation Graph (0, 0)][DBLP]
    STOC, 1970, pp:221-225 [Conf]
  32. Maurice Nivat, Dominique Perrin
    Ensembles Reconnaissables de Mots Biinfinis [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:47-59 [Conf]
  33. Maurice Nivat
    New Challenges for Theoretical Computer Science. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:11-14 [Conf]
  34. Luc Boasson, Maurice Nivat
    Centers of Languages. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:245-251 [Conf]
  35. Luc Boasson, J. P. Crestin, Maurice Nivat
    Familles de langages translatables et fermées par crochet [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1973, v:2, n:, pp:383-393 [Journal]
  36. Luc Boasson, Maurice Nivat
    Sur diverses familles de langages fermées par transductions rationelle [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1973, v:2, n:, pp:180-188 [Journal]
  37. Hermann A. Maurer, Maurice Nivat
    Rational Bijection of Rational Sets. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1980, v:13, n:, pp:365-378 [Journal]
  38. Danièle Beauquier, Maurice Nivat, Eric Rémila, Mike Robson
    Tiling Figures of the Plane with Two Bars. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:1-25 [Journal]
  39. Alain Daurat, Maurice Nivat
    Salient and reentrant points of discrete sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:151, n:1-3, pp:106-121 [Journal]
  40. Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, Simone Rinaldi
    A bijection for the total area of parallelogram polyominoes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:291-302 [Journal]
  41. Danièle Beauquier, Maurice Nivat
    On Translating One Polyomino to Tile the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:575-592 [Journal]
  42. Alain Daurat, Alberto Del Lungo, Maurice Nivat
    Medians of Discrete Sets according to a Linear Distance. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:4, pp:465-484 [Journal]
  43. Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat
    Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:65-78 [Journal]
  44. André Arnold, Anne Dicky, Maurice Nivat
    A note about minimal non-deterministic automata. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1992, v:47, n:, pp:166-169 [Journal]
  45. Maurice Nivat, Andreas Podelski
    Definite tree languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:38, n:, pp:186-190 [Journal]
  46. Maurice Nivat, Ahmed Saoudi
    Automata on infinite trees and Kleene closure of regular tree sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:36, n:, pp:131-136 [Journal]
  47. André Arnold, Maurice Nivat
    The metric space of infinite trees. Algebraic and topological properties. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1980, v:3, n:4, pp:445-476 [Journal]
  48. Maurice Nivat, Ahmed Saoudi
    Automata on Infinite Objects and Their Applications to Logic and Programming [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:1, pp:41-64 [Journal]
  49. Srecko Brlek, Sylvie Hamel, Maurice Nivat, Christophe Reutenauer
    On The Palindromic Complexity Of Infinite Words. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:2, pp:293-306 [Journal]
  50. P. Laroche, Maurice Nivat, Ahmed Saoudi
    Context-Sensitivity of Puzzle Grammars. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 1994, v:8, n:2, pp:525-542 [Journal]
  51. Maurice Nivat, Ahmed Saoudi
    Parallel Recognition of High Dimensional Images. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 1992, v:6, n:2&3, pp:285-291 [Journal]
  52. Ahmed Saoudi, Maurice Nivat
    Parallel Algorithms for Multi-Dimensional Image Template Matching. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 1994, v:8, n:2, pp:457-464 [Journal]
  53. Jan van Leeuwen, Maurice Nivat
    Efficient Recognition of Rational Relations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:1, pp:34-38 [Journal]
  54. Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, L. Sorri
    The Medians of Discrete Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:6, pp:293-299 [Journal]
  55. Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Maurice Nivat
    Quelques problèmes ouverts en théorie des langages algébriques. [Citation Graph (0, 0)][DBLP]
    ITA, 1979, v:13, n:4, pp:- [Journal]
  56. Carole Delporte-Gallet, Hugues Fauconnier, Maurice Nivat
    Parallélisation d'algorithmes avec un nombre fixe de processeurs. [Citation Graph (0, 0)][DBLP]
    ITA, 1990, v:24, n:, pp:353-386 [Journal]
  57. Maurice Nivat
    Mots Infinis Engendrés par Une Grammaire Algébrique. [Citation Graph (0, 0)][DBLP]
    ITA, 1977, v:11, n:4, pp:311-327 [Journal]
  58. Maurice Nivat
    Sur les ensembles de mots infins engendrés par une grammaire algébrique. [Citation Graph (0, 0)][DBLP]
    ITA, 1978, v:12, n:3, pp:- [Journal]
  59. Luc Boasson, Maurice Nivat
    Adherences of Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:3, pp:285-309 [Journal]
  60. André Arnold, Maurice Nivat
    Formal Computations of Non Deterministic Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1980, v:13, n:, pp:219-236 [Journal]
  61. Luc Boasson, Maurice Nivat
    Le Cylindre des Langages Linéaires. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1977, v:11, n:, pp:147-155 [Journal]
  62. Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram
    Efficient Parallel Shuffle Recognition. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:455-463 [Journal]
  63. Luc Boasson, Bruno Courcelle, Maurice Nivat
    The Rational Index: A Complexity Measure for Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:284-296 [Journal]
  64. Ronald V. Book, Maurice Nivat
    Linear Languages and the Intersection Closures of Classes of Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:2, pp:167-177 [Journal]
  65. Ronald V. Book, Maurice Nivat, Mike Paterson
    Reversal-Bounded Acceptors and Intersections of Linear Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1974, v:3, n:4, pp:283-295 [Journal]
  66. Maurice Nivat, Andreas Podelski
    Minimal Ascending and Descending Tree Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:39-58 [Journal]
  67. André Arnold, Maurice Nivat
    Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:181-205 [Journal]
  68. Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani
    Reconstructing Convex Polyominoes from Horizontal and Vertical Projections. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:2, pp:321-347 [Journal]
  69. Danièle Beauquier, Maurice Nivat
    A codicity undecidable problem in the plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:303, pp:417-430 [Journal]
  70. Yacine Boufkhad, Olivier Dubois, Maurice Nivat
    Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1647-1664 [Journal]
  71. Alain Daurat, Yan Gérard, Maurice Nivat
    The chords' problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:282, n:2, pp:319-336 [Journal]
  72. Alain Daurat, Yan Gérard, Maurice Nivat
    Some necessary clarifications about the chords' problem and the Partial Digest Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:432-436 [Journal]
  73. Andrea Frosini, Maurice Nivat, Laurent Vuillon
    An introduction to periodical discrete sets from a tomographical perspective. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:370-392 [Journal]
  74. Attila Kuba, Maurice Nivat
    A sufficient condition for non-uniqueness in binary tomography with absorption. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:346, n:2-3, pp:335-357 [Journal]
  75. Maurice Nivat
    25 Years. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:- [Journal]
  76. Maurice Nivat
    For the 50th anniversary of Eric Goles: A few words by Maurice Nivat. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:322, n:2, pp:233-235 [Journal]
  77. Andrea Frosini, Maurice Nivat
    Binary matrices under the microscope: A tomographical problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:201-217 [Journal]
  78. Maurice Nivat, Andreas Podelski
    Another variation on the common subexpression problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:379-401 [Journal]
  79. Alberto Del Lungo, Maurice Nivat, Renzo Pinzani
    The number of convex polyominoes reconstructible from their orthogonal projections. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:157, n:1-3, pp:65-78 [Journal]

  80. Automata, tilings and tomography. [Citation Graph (, )][DBLP]


Search in 0.083secs, Finished in 0.086secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002