Pascal Caron

According to our database1, Pascal Caron
  • authored at least 38 papers between 1997 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On the hierarchy of generalizations of one-unambiguous regular languages.
Theor. Comput. Sci., 2017

On the decidability of $k$-Block determinism.
CoRR, 2017

State complexity of catenation combined with boolean operations.
CoRR, 2017

2016
State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach.
Int. J. Found. Comput. Sci., 2016

State complexity of multiple catenation.
CoRR, 2016

2015
On the Hierarchy of Block Deterministic Languages.
CoRR, 2015

State complexity of catenation combined with a boolean operation: a unified approach.
CoRR, 2015

On the Hierarchy of Block Deterministic Languages.
Proceedings of the Implementation and Application of Automata, 2015

2014
A general framework for the derivation of regular expressions.
RAIRO - Theor. Inf. and Applic., 2014

(k, l)-Unambiguity and Quasi-Deterministic Structures.
CoRR, 2014

(k, l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization.
Proceedings of the Language and Automata Theory and Applications, 2014

2012
Preface.
Theor. Comput. Sci., 2012

Obituary for Sheng Yu.
Theor. Comput. Sci., 2012

A General Framework for the Derivation of Regular Expressions
CoRR, 2012

Multi-tilde-bar expressions and their automata.
Acta Inf., 2012

Multi-Tilde-Bar Derivatives.
Proceedings of the Implementation and Application of Automata, 2012

2011
Erratum to "Acyclic automata and small expressions using multi-tilde-bar operators" [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435].
Theor. Comput. Sci., 2011

Multi-Bar and Multi-Tilde Regular Operators.
Journal of Automata, Languages and Combinatorics, 2011

From Glushkov WFAs to K-Expressions.
Fundam. Inform., 2011

Partial Derivatives of an Extended Regular Expression.
Proceedings of the Language and Automata Theory and Applications, 2011

Generalized One-Unambiguity.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Acyclic automata and small expressions using multi-tilde-bar operators.
Theor. Comput. Sci., 2010

On Glushkov K-graphs.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
Algorithms for Glushkov K-graphs
CoRR, 2009

Small Extended Expressions for Acyclic Automata.
Proceedings of the Implementation and Application of Automata, 2009

A New Family of Regular Operators Fitting with the Position Automaton Computation.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Multi-tilde Operators and Their Glushkov Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

2003
Glushkov Construction for Series: The Non Commutative Case.
Int. J. Comput. Math., 2003

From Glushkov WFAs to Rational Expressions.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Star Normal Form, Rational Expressions, and Glushkov WFAs Properties.
Proceedings of the Implementation and Application of Automata, 2002

2000
Characterization of Glushkov automata.
Theor. Comput. Sci., 2000

Families of locally testable languages.
Theor. Comput. Sci., 2000

LANGAGE: A Maple Package for Automaton Characterization of Regular Languages.
Theor. Comput. Sci., 2000

Glushkov Construction for Multiplicities.
Proceedings of the Implementation and Application of Automata, 2000

1999
SEA: A Symbolic Environment for Automata Theory.
Proceedings of the Automata Implementation, 1999

1997
AG: A Set of Maple Packages for Manipulating Automata and Semigroups.
Softw., Pract. Exper., 1997

LANGAGE: A Maple Package for Automaton Characterization of Regular Languages.
Proceedings of the Automata Implementation, 1997

AG: A Set of Maple Packages for Symbolic Computing of Automata and Semigroups.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997


  Loading...