7 citations · 22 across the 9 of their papers we have counts for
9 papers
The decidability of the genus of regular languages and directed emulators
Guillaume Bonfante, Florian Deloup
The article continues our study of the genus of a regular language , defined as the minimal genus among all genera of all finite deterministic automata recognizing . Here we…
Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis
Guillaume Bonfante, Georg Moser
The DICE workshop explores the area of Implicit Computational Complexity (ICC), which grew out from several proposals to use logic and formal methods to provide languages for compl…
Decidability of regular language genus computation
Guillaume Bonfante, Florian Deloup
The article continues the study of the genus of regular languages that the authors introduced in a 2012 paper. Generalizing a previous result, we produce a new family of regular la…
Analysis and Diversion of Duqu's Driver
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier +1
The propagation techniques and the payload of Duqu have been closely studied over the past year and it has been said that Duqu shared functionalities with Stuxnet. We focused on th…
Non-simplifying Graph Rewriting Termination
Guillaume Bonfante, Bruno Guillaume
So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's wo…
The genus of regular languages
Guillaume Bonfante, Florian Deloup
The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus ari…