Géraud Sénizergues

According to our database1, Géraud Sénizergues
  • authored at least 55 papers between 1981 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Equations Over Free Inverse Monoids with Idempotent Variables.
Theory Comput. Syst., 2017

2015
Bottom-up rewriting for words and terms.
J. Symb. Comput., 2015

Equations over Free Inverse Monoids with Idempotent Variables.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
Word-Mappings of Level 2.
Theory Comput. Syst., 2014

FREC 14: FRontiers of RECognizability.
CoRR, 2014

Equations over free inverse monoids with idempotent variables.
CoRR, 2014

2013
LALBLC A Program Testing the Equivalence of dpda's.
Proceedings of the Implementation and Application of Automata, 2013

2011
Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness
CoRR, 2011

2010
Termination of linear bounded term rewriting systems.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009
Tree Automata and Automata on Linear Orderings.
ITA, 2009

Bottom-up rewriting for words and terms
CoRR, 2009

2008
Rational Subsets in HNN-Extensions and Amalgamated Products.
IJAC, 2008

2007
Equations in Free Inverse Monoids.
IJAC, 2007

Bottom-Up Rewriting Is Inverse Recognizability Preserving.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Sequences of Level 1, 2, 3, ..., k , ...
Proceedings of the Computer Science, 2007

2006
Iterated pushdown automata and sequences of rational numbers.
Ann. Pure Appl. Logic, 2006

Theories of HNN-Extensions and Amalgamated Products.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Decision problems for semi-Thue systems with a few rules.
Theor. Comput. Sci., 2005

The Bisimulation Problem for Equational Graphs of Finite Out-Degree.
SIAM J. Comput., 2005

2003
The Equivalence Problem for t-Turn DPDA Is Co-NP.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
L(A)=L(B)? A simplified decidability proof.
Theor. Comput. Sci., 2002

L(A) = L(B)? Decidability Results from Complete Formal Systems.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
L(A)=L(B)? decidability results from complete formal systems.
Theor. Comput. Sci., 2001

Some Applications of the Decidability of DPDA's Equivalence.
Proceedings of the Machines, 2001

2000
Complete formal systems for equivalence problems.
Theor. Comput. Sci., 2000

The Bisimulation Problem for equational graphs of finite out-degree
CoRR, 2000

1999
T(A) = T(B)?
Proceedings of the Automata, 1999

1998
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems.
Theor. Comput. Sci., 1998

The obstructions of a minor-closed set of graphs defined by a context-free grammar.
Discrete Mathematics, 1998

The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Complete Formal Systems for Equivalence Problems.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
L(A) = L(B)?
Electr. Notes Theor. Comput. Sci., 1997

The Equivalence Problem for Deterministic Pushdown Automata is Decidable.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
On the Rational Subsets of the Free Group.
Acta Inf., 1996

On the Termination Problem for One-Rule Semi-Thue System.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

Decision Problems for Semi-Thue Systems with a Few Rules.
Proceedings of the Proceedings, 1996

Semi-Groups Acting on Context-Free Graphs.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
Some Undecidable Termination Problems for Semi-Thue Systems.
Theor. Comput. Sci., 1995

A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

1994
The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

On the finite subgroups of a context-free group.
Proceedings of the Geometric and Computational Perspectives on Infinite Groups, 1994

1993
Some Undecidable Termination Problems for Semi-Thue Systems (Abstract).
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

An Effective Version of Stallings' Theorem in the Case of Context-Free Groups.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Formal Languages and Word-Rewriting.
Proceedings of the Term Rewriting, 1993

1990
Some Decision Problems about Controlled Rewriting Systems.
Theor. Comput. Sci., 1990

A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences.
Theor. Comput. Sci., 1990

1989
Church-Rosser Controller Rewriting Systems and Equivalence problems for Deterministic Context-Free Languages
Inf. Comput., June, 1989

1987
Groups and NTS Languages.
J. Comput. Syst. Sci., 1987

1985
The Equivalence and Inclusion Problems for NTS Languages.
J. Comput. Syst. Sci., 1985

NTS Languages Are Deterministic and Congruential.
J. Comput. Syst. Sci., 1985

1984
Remarques sur les Langages de Parenthèses.
Theor. Comput. Sci., 1984

Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses.
ITA, 1984

1983
The equivalence problem for N.T.S. languages is decidable.
Proceedings of the Theoretical Computer Science, 1983

1981
A New Class of C.F.L. for Which the Equivalence is Decidable.
Inf. Process. Lett., 1981


  Loading...