#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2006

2017

- This year (1)
- Last 5 years (2)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gérard P. Huet, Benoît Razet
- Mathematical Structures in Computer Science
- 2017

Mathematical Structures in Computer Science / FirstView Article / July 2015, pp 1 20 DOI: 10.1017/S0960129515000390, Published online: 15 July 2015 Link to this article: http://journals.cambridge.org/abstract_S0960129515000390 How to cite this article: GÉRARD HUET and BENOÎT RAZET Computing with relational machines. Mathematical Structures in Computer… (More)

- Gérard P. Huet, Benoît Razet
- Essays Dedicated to Joseph A. Goguen
- 2006

This paper explains the design of the second release of the Zen toolkit [5–7]. It presents a notion of reactive engine which simulates finite-state machines represented as shared aums [8]. We show that it yields a modular interpreter for finite state machines described as local transducers. For instance, in the manner of Berry and Sethi, we define a… (More)

- Cyril Nicaud, Carine Pivoteau, Benoît Razet
- FSTTCS
- 2010

We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the expressions. A recent work shows that, under the uniform distribution, regular expressions lead to automata with a linear number of transitions. However, uniform regular expressions… (More)

- Benoît Razet
- CIAA
- 2008

Eilenberg machines define a general computational model. They are well suited to the simulation of problems specified using finite state formalisms such as formal languages and automata theory. This paper introduces a subclass of them called finite Eilenberg machines. We give a formal description of complete and efficient algorithms which permit the… (More)

- Benoît Razet
- Electr. Notes Theor. Comput. Sci.
- 2011

Eilenberg machines have been introduced in 1974 in the field of formal language theory. They are finite automata for which the alphabet is interpreted by mathematical relations over an abstract set. They generalize many finite state machines. We consider in the present work the subclass of finite Eilenberg machines for which we provide an executable… (More)

- Benoît Razet
- 2009

- Benoit Razet, Bodhayan Roy
- 2016

Deciding the equivalence of regular expressions is a fundamental problem of theoretical computer science. On one hand, there are several decision procedures to solve this problem. On the other hand, there are several axiomatisations of the equivalence of regular expression. The axiomatisations are proved to be complete and the proofs consists of showing… (More)

- ‹
- 1
- ›