-
Minimal Forbidden Words and Applications
Version révisée après soutenance -
Closure properties and decision problems of dag automata
Tree automata are widely used in various contexts. They are closed under boolean operations and their emptiness problem decidable in polynomial time. Dag automata are... -
Computing probability of Borelian languages
The Kolmogorov extension theorem shows that, for any probability law π on A∗ , there exists one and only one probability measure, namely Pπ , on the family of Borelian... -
Enforcing virtualized systems security
Virtual machine technology is rapidly gaining acceptance as a fundamental building block in enterprise data centers. It is most known for improving efficiency and ease... -
Well quasi-orders and the shuffle closure of finite sets
International audience -
The FC-rank of a context-free language
International audience -
Towards a Higher-Dimensional String Theory for the Modeling of Computerized S...
International audience -
Dominance Constraints in Stratified Context Unification
International audience -
Finite Automata with Generalized Acceptance Criteria
International audience -
On IO-Copying and Mildly-Context Sensitive Formalisms
International audience -
New decidable upper bound of the second level in the Straubing-Therien concat...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications -
Embedding finite and infinite words into overlapping tiles
International audience
