Zobrazeno 1 - 10
of 662
pro vyhledávání: '"Continuous automaton"'
Publikováno v:
Information and Computation. 259:162-173
We generalize the partial derivative automaton and the position automaton to regular expressions with shuffle, and study their state complexity in the worst, as well as in the average case. The number of states of the partial derivative automaton ( A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c07bcdbbdabec88efaffabb238d9a283
https://doi.org/10.1016/j.ic.2017.08.013
https://doi.org/10.1016/j.ic.2017.08.013
Autor:
Thibault Godin, Ines Klimann
Publikováno v:
Theoretical Computer Science. 707:24-35
There exist undoubtedly strong links between the Burnside problem and the class of automaton groups. Indeed, many interesting examples of infinite Burnside groups are automaton groups, in particular for any prime p , there exist an infinite Burnise p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf468e46c7fc21170a4d208db9a54f5c
https://doi.org/10.1016/j.tcs.2017.10.005
https://doi.org/10.1016/j.tcs.2017.10.005
Autor:
Kenichi Morita
Publikováno v:
Natural Computing. 18:413-428
We study a simple triangular partitioned cellular automaton (TPCA), and clarify its complex behavior. It is a CA with triangular cells, each of which is divided into three parts. The next state of a cell is determined by the three adjacent parts of i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68dfd4c6f79f75253d94961463520fc2
https://doi.org/10.1007/s11047-017-9655-9
https://doi.org/10.1007/s11047-017-9655-9
Publikováno v:
Natural Computing. 17:499-509
This paper presents a 3-state asynchronous CA that requires merely two transition rules to achieve computational universality. This universality is achieved by embedding Priese’s delay-insensitive circuit elements, called the E-element and the K-el
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::723f1a026f48447f1f2b07c3efb6e088
https://doi.org/10.1007/s11047-017-9651-0
https://doi.org/10.1007/s11047-017-9651-0
Autor:
Adam Woryna
Publikováno v:
Journal of Computer and System Sciences. 86:181-190
Extending the notion of bi-reversibility to automata over a changing alphabet.Absence of 2-state bi-reversible automata over a bounded changing alphabet which generate the non-abelian free group F2.Natural and applicable realization of F2 by a 2-stat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb4a77d208e64b74d96e7fd60d74581f
https://doi.org/10.1016/j.jcss.2017.01.004
https://doi.org/10.1016/j.jcss.2017.01.004
Autor:
Vojtěch Vorel
Publikováno v:
Information and Computation. 253:497-509
A word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given maximum length for a given automaton is known to be an NP-complet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9193797a26f602bc1ce33049b9551d4b
https://doi.org/10.1016/j.ic.2016.06.013
https://doi.org/10.1016/j.ic.2016.06.013
Autor:
Alexander V. Kuznetsov
Publikováno v:
Computational Mathematics and Mathematical Physics. 57:340-349
The collective interaction of agents for jointly overcoming (negotiating) obstacles is simulated. The simulation uses a cellular automaton. The automaton’s cells are filled with agents and obstacles of various complexity. The agents' task is to neg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2741e407cbf46a540ac3855cb493f9c
https://doi.org/10.1134/s0965542517020099
https://doi.org/10.1134/s0965542517020099
Autor:
Shigeo Hayashi
Publikováno v:
Electrochemistry. 85:23-26
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5afd0f95a0d24ca72a49a01959903762
https://doi.org/10.5796/electrochemistry.85.23
https://doi.org/10.5796/electrochemistry.85.23
Autor:
Biljana Stamatovic, Goran Kilibarda
Publikováno v:
Mathematical Problems in Engineering, Vol 2017 (2017)
We propose a finite automaton based algorithm for identification of infinite clusters in a 2D rectangular lattice with L=X×Y cells. The algorithm counts infinite clusters and finds one path per infinite cluster in a single pass of the finite automat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7967e1c651303588f3cfe4dd4a2a2381
https://doi.org/10.1155/2017/8251305
https://doi.org/10.1155/2017/8251305
Autor:
Minjie Lei
Publikováno v:
Complex Systems. 25:285-296
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5dea84dd826ac69edcdcaa5d9f963ab
https://doi.org/10.25088/complexsystems.25.4.285
https://doi.org/10.25088/complexsystems.25.4.285