Jean-Luc Ponty

According to our database1, Jean-Luc Ponty authored at least 8 papers between 1996 and 2004.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2004
A characterization of Thompson digraphs.
Discrete Applied Mathematics, 2004

2000
An Efficient Null-Free Procedure for Deciding Regular Language Membership.
Theor. Comput. Sci., 2000

1999
From regular expressions to finite automata.
Int. J. Comput. Math., 1999

Thompson Digraphs: A Characterization.
Proceedings of the Automata Implementation, 1999

Thompson Languages.
Proceedings of the Jewels are Forever, 1999

1998
Determinization of Glushkov Automata.
Proceedings of the Automata Implementation, 1998

1997
An Efficient Null-Free Procedure for Deciding Regular Language Membership.
Proceedings of the Automata Implementation, 1997

1996
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton.
Proceedings of the Automata Implementation, 1996


  Loading...