Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Provillard, Julien"'
This paper investigates acceptance conditions for finite automata recognizing omega-regular languages. As a first result, we show that, under any acceptance condition that can be defined in the MSO logic, a finite automaton can recognize at most omeg
Externí odkaz:
http://arxiv.org/abs/1310.5032
In this paper we study $\nu$-CA on one-dimensional lattice defined over a finite set of local rules. The main goal is to determine how the local rules can be mixed to ensure the produced $\nu$-CA has some properties. In a first part, we give some bac
Externí odkaz:
http://arxiv.org/abs/1108.1419
The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like surjectivity and inje
Externí odkaz:
http://arxiv.org/abs/1107.5228
Publikováno v:
In Theoretical Computer Science 20 November 2014 559:73-90
Publikováno v:
In Theoretical Computer Science 16 September 2013 504:38-51
Publikováno v:
In Information and Computation June 2012 215:32-46
Publikováno v:
Fundamenta Informaticae. 2015, Vol. 136 Issue 1-2, p139-155. 17p.
Publikováno v:
Journal of Automata, Languages and Combinatorics
Journal of Automata, Languages and Combinatorics, 2017, 22 (4), pp.271-286. ⟨10.25596/jalc-2017-271⟩
16th Mons Theoretical Computer Science Days
16th Mons Theoretical Computer Science Days, Sep 2016, Liège, Belgium
Journal of Automata, Languages and Combinatorics, 2017, 22 (4), pp.271-286. ⟨10.25596/jalc-2017-271⟩
16th Mons Theoretical Computer Science Days
16th Mons Theoretical Computer Science Days, Sep 2016, Liège, Belgium
A finite language~$X$ over an alphabet~$\S$ is complete if any word in~$\S^*$ is a factor of a word in~$X^*$. A word which is not a factor of~$X^*$ is said uncompletable. Among them, some are \mi\ as all their proper factors belong to~$\fact(X^*)$. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::852833cd786f323020d9eec74adfb2c0
https://hal.archives-ouvertes.fr/hal-01665399
https://hal.archives-ouvertes.fr/hal-01665399
Publikováno v:
Non-Classical Models for Automata and Applications
Non-Classical Models for Automata and Applications, Aug 2013, Umeå, Sweden. pp.195-208
Non-Classical Models for Automata and Applications, Aug 2013, Umeå, Sweden. pp.195-208
International audience; Deterministic one-way Turing machines with sublinear space bounds are systematically studied. We distinguish among the notions of strong, weak, and restricted space bounds. The latter is motivated by the study of P automata. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7deea399f5fa8363721d96b834d0ff91
https://hal.archives-ouvertes.fr/hal-01297603
https://hal.archives-ouvertes.fr/hal-01297603
Autor:
Provillard, Julien
Publikováno v:
Mathématique discrète [cs.DM]. Université Nice Sophia Antipolis, 2012. Français
This thesis introduces a new dynamical system which generalizes the cellular automata (CA) : non-uniform cellular automata (nuCA). The nuCAs are obtained by relaxing the spatial uniformity of the local rule of CAs. The global rule is now given by a d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2592::28c266f461eef7a6fa63aa7637ad54a5
https://hal.archives-ouvertes.fr/tel-01297387/document
https://hal.archives-ouvertes.fr/tel-01297387/document