Share This Author
- D. Perrin
- Computer SciencePhilosophy
- 1 January 1958
I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently…
Infinite words - automata, semigroups, logic and games
A new string-matching algorithm is presented, which can be viewed as an intermediate between the classical algorithms of Knuth, Morris, and Pratt and Boyer and Moore, which presents the advantage of being remarkably simple which consequently makes its analysis possible.
First-Order Logic and Star-Free Sets
Codes and Automata
- J. Berstel, D. Perrin, C. Reutenauer
- Computer ScienceEncyclopedia of mathematics and its applications
- 14 December 2009
This paper presents a meta-anatomy of the polynomials of finite codes using a model derived from the model developed in [Bouchut-Boyaval, M3AS (23) 2013].
Recent Results on Automata and Infinite Words
- D. Perrin
- Computer ScienceMFCS
- 3 September 1984
The theory of automata on infinite words was initiated by Buchi and McNaughton at the beginning of the sixties, with a flavour of mathematical logic, and has now become standard in several areas of algorithm design and I think that the same will happen in the next future with automataon infinite words.
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
It is shown that for any finite synchronized prefix code with an n-state decoder, there is a synchronizing word of length O(n 2)2, which applies in particular to Huffman codes.
On the Expressive Power of Temporal Logic