The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Géraud Sénizergues: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Géraud Sénizergues
    Formal Languages and Word-Rewriting. [Citation Graph (0, 0)][DBLP]
    Term Rewriting, 1993, pp:75-94 [Conf]
  2. Géraud Sénizergues
    Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:120-129 [Conf]
  3. Markus Lohrey, Géraud Sénizergues
    Theories of HNN-Extensions and Amalgamated Products. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:504-515 [Conf]
  4. Géraud Sénizergues
    L(A) = L(B)? Decidability Results from Complete Formal Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:37- [Conf]
  5. Géraud Sénizergues
    The Equivalence Problem for t-Turn DPDA Is Co-NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:478-489 [Conf]
  6. Géraud Sénizergues
    An Effective Version of Stallings' Theorem in the Case of Context-Free Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:478-495 [Conf]
  7. Géraud Sénizergues
    Semi-Groups Acting on Context-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:206-218 [Conf]
  8. Géraud Sénizergues
    The Equivalence Problem for Deterministic Pushdown Automata is Decidable. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:671-681 [Conf]
  9. Géraud Sénizergues
    T(A) = T(B)? [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:665-675 [Conf]
  10. Yuri Matiyasevich, Géraud Sénizergues
    Decision Problems for Semi-Thue Systems with a Few Rules. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:523-531 [Conf]
  11. Géraud Sénizergues
    Some Applications of the Decidability of DPDA's Equivalence. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:114-132 [Conf]
  12. Géraud Sénizergues
    Complete Formal Systems for Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    MCU (1), 1998, pp:22-49 [Conf]
  13. Géraud Sénizergues
    The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:305-315 [Conf]
  14. Géraud Sénizergues
    Some Undecidable Termination Problems for Semi-Thue Systems (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:434- [Conf]
  15. Géraud Sénizergues
    A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:194-209 [Conf]
  16. Géraud Sénizergues
    On the Termination Problem for One-Rule Semi-Thue System. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:302-316 [Conf]
  17. Bruno Courcelle, Géraud Sénizergues
    The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:351-367 [Conf]
  18. Géraud Sénizergues
    The equivalence problem for N.T.S. languages is decidable. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:313-323 [Conf]
  19. Géraud Sénizergues
    On the Rational Subsets of the Free Group. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:3, pp:281-296 [Journal]
  20. S. Fratani, Géraud Sénizergues
    Iterated pushdown automata and sequences of rational numbers. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:363-411 [Journal]
  21. Géraud Sénizergues
    The Bisimulation Problem for equational graphs of finite out-degree [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  22. Géraud Sénizergues
    L(A) = L(B)? [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
  23. Géraud Sénizergues
    Church-Rosser Controller Rewriting Systems and Equivalence problems for Deterministic Context-Free Languages [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:81, n:3, pp:265-279 [Journal]
  24. Géraud Sénizergues
    A New Class of C.F.L. for Which the Equivalence is Decidable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:1, pp:30-34 [Journal]
  25. Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues
    Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses. [Citation Graph (0, 0)][DBLP]
    ITA, 1984, v:18, n:4, pp:327-344 [Journal]
  26. Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues
    Groups and NTS Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:35, n:2, pp:243-267 [Journal]
  27. Luc Boasson, Géraud Sénizergues
    NTS Languages Are Deterministic and Congruential. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:3, pp:332-342 [Journal]
  28. Géraud Sénizergues
    The Equivalence and Inclusion Problems for NTS Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:3, pp:303-331 [Journal]
  29. Géraud Sénizergues
    The Bisimulation Problem for Equational Graphs of Finite Out-Degree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1025-1106 [Journal]
  30. Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Géraud Sénizergues
    Remarques sur les Langages de Parenthèses. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:31, n:, pp:337-349 [Journal]
  31. Yuri Matiyasevich, Géraud Sénizergues
    Decision problems for semi-Thue systems with a few rules. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:145-169 [Journal]
  32. Géraud Sénizergues
    Complete formal systems for equivalence problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:231, n:2, pp:309-334 [Journal]
  33. Géraud Sénizergues
    L(A)=L(B)? decidability results from complete formal systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:251, n:1-2, pp:1-166 [Journal]
  34. Géraud Sénizergues
    L(A)=L(B)? A simplified decidability proof. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:555-608 [Journal]
  35. Géraud Sénizergues
    A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:2, pp:213-232 [Journal]
  36. Géraud Sénizergues
    Some Decision Problems about Controlled Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:71, n:3, pp:281-346 [Journal]
  37. Géraud Sénizergues
    Some Undecidable Termination Problems for Semi-Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:257-276 [Journal]
  38. Géraud Sénizergues
    A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:192, n:1, pp:55-75 [Journal]
  39. Géraud Sénizergues
    Sequences of Level 1, 2, 3, ..., k , ... [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:24-32 [Conf]
  40. Irène Durand, Géraud Sénizergues
    Bottom-Up Rewriting Is Inverse Recognizability Preserving. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:107-121 [Conf]
  41. Bruno Courcelle, Géraud Sénizergues
    The obstructions of a minor-closed set of graphs defined by a context-free grammar. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:29-51 [Journal]

  42. Termination of linear bounded term rewriting systems. [Citation Graph (, )][DBLP]


  43. Bottom-up rewriting for words and terms [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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