#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1995

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Philippe Andary, Bruno Patrou, Pierre Valarcher
- Fundam. Inform.
- 2011

We formalize the algorithms computing primitive recursive (PR) functions as the abstract state machines (ASMs) whose running length is computable by a PR function. Then we show that there exists a programming language (implementing only PR functions) by which it is possible to implement any one of the previously defined algorithms for the PR functions in… (More)

- Pascal Caron, Jean-Gabriel Luque, Ludovic Mignot, Bruno Patrou
- Int. J. Found. Comput. Sci.
- 2016

In this paper we study the state complexity of catenation combined with symmetric difference. First, an upper bound is computed using some combinatoric tools. Then, this bound is shown to be tight by giving a witness for it. Moreover, we relate this work with the study of state complexity for two other combinations: catenation with union and catenation with… (More)

- Pascal Caron, Jean-Gabriel Luque, Bruno Patrou
- ArXiv
- 2016

We improve some results relative to the state complexity of the multiple catenation described by Gao and Yu. In particular we nearly divide by 2 the size of the alphabet needed for witnesses. We also give some refinements to the algebraic expression of the state complexity, which is especially complex with this operation. We obtain these results by using… (More)

- Sandrine Julia, Igor Litovsky, Bruno Patrou
- Inf. Process. Lett.
- 1996

- Bruno Patrou
- Combinatorics and Computer Science
- 1995

- Bertrand Le Saëc, Igor Litovsky, Bruno Patrou
- ITA
- 1996

- Philippe Andary, Bruno Patrou, Pierre Valarcher
- Abstract State Machines
- 2005

- Igor Litovsky, Bruno Patrou
- Developments in Language Theory
- 1997

- Pascal Caron, Jean-Gabriel Luque, Bruno Patrou
- ArXiv
- 2017

We exhaustively investigate possible combinations of a boolean operation together with a catenation. In many cases we prove and improve some conjectures by Brzozowski. For each family of operation, we endeavour to provide a common witness with a small size alphabet.

- ‹
- 1
- ›