Filters








11,280 Hits in 4.4 sec

Parallel communicating one-way reversible finite automata system [article]

Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray
2019 arXiv   pre-print
On the basis of which we conjecture that parallel communicating one-way reversible finite automata systems may accept languages not accepted by multi-head one way reversible finite automata.  ...  In this paper, we discuss the computational power of parallel communicating finite automata system with 1-way reversible finite automaton as components.  ...  power as deterministic/non-deterministic parallel communicating finite automata systems.  ... 
arXiv:1903.10428v1 fatcat:3dp2woqeuvgd5cgxfgmippjc34

A New Block Cipher Based on Finite Automata Systems

Gh Khaleel, SHERZOD TURAEV, M.I.M. Tamrin, Imad F. Al-Shaikhli
2016 International Journal on Perceptive and Cognitive Computing  
This paper presents a new block cipher based on finiteautomata system. The proposed cryptosystem is executed based on parallel computations to reduce thedelay time.  ...  The performance and security have central importance of cryptography field. Therefore, theneed to use block ciphers are become very important.  ...  PARALLEL IMPLEMENTATIONIn implementation part, both the approaches, parallel approach or the proposed block cipher based on finite automata (parallel of NFAEA and NFADA algorithms) and sequential approach  ... 
doi:10.31436/ijpcc.v2i1.31 fatcat:xsn6gx4llrbodhocvfsqmfjw6a

Page 517 of Mathematical Reviews Vol. , Issue 2002A [page]

2002 Mathematical Reviews  
We show that, sta- tistically, at any level of confidence a € (1/2, 11/6], the class of deterministic automata simulating Mermin probabilistic automata displays fewer correlations than typical deterministic  ...  Svozil, “Quantum correlations. ..”, op cit.] for Mermin probabilistic automata correspond to computa- tional complementarity of the deterministic automata simulating Mermin probabilistic automata.”  ... 

Page 1217 of Mathematical Reviews Vol. , Issue 83c [page]

1983 Mathematical Reviews  
A rather complete characterization of the relative power of the following features of automata on d-dags is obtained: parallel versus sequential, deterministic versus nondeterministic and finite state  ...  Authors’ summary: “A multiple entry finite automaton (mefa) can be viewed as a set of finite automata acting in parallel but in a compacted form.  ... 

Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching

Ryoma Sinya, Kiminori Matsuzaki, Masataka Sassa
2013 2013 42nd International Conference on Parallel Processing  
Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation.  ...  Though it is known in theory that we can perform the computation of a finite automaton in parallel by simulating transitions, its implementation has a large overhead due to the simulation.  ...  Acknowledgments We would like to thank Kazuhiro Inaba for the helpful discussion with him on the prior works described in Sect. III and Sect. VII-B.  ... 
doi:10.1109/icpp.2013.31 dblp:conf/icpp/SinyaMS13 fatcat:osbqqqkbzzhdnia7fqnz7wfrqy

Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching [article]

Ryoma Sin'ya, Kiminori Matsuzaki, Masataka Sassa
2014 arXiv   pre-print
Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation.  ...  Though it is known in theory that we can perform the computation of a finite automaton in parallel by simulating transitions, its implementation has a large overhead due to the simulation.  ...  Acknowledgments We would like to thank Kazuhiro Inaba for the helpful discussion with him on the prior works described in Sect. III and Sect. VII-B.  ... 
arXiv:1405.0562v1 fatcat:jct7x56zdjgx3gwdvsl5pfxyzq

VisA: A Tool for Visualizing and Animating Automata and Formal Languages [chapter]

Markus Holzer, Muriel Quenzer
1998 Lecture Notes in Computer Science  
on a given input string, (2) step-by-step conversion of a nondeterministic finite automaton into an equivalent deterministic one (powerset construction), (3) step-by-step conversion of a finite automaton  ...  Due to the wide range of the material of a complete undergraduate course in automata theory and formal languages, we have restricted the first implementation phase to finite automata only.  ...  One step in the animation of the powerset construction for state {q 0 , q 3 } applied to the finite automaton depicted on the left-hand side.  ... 
doi:10.1007/3-540-37623-2_41 fatcat:4y7se4zevfcxvaivueilo4d5by

Page 7342 of Mathematical Reviews Vol. , Issue 2000j [page]

2000 Mathematical Reviews  
(English summary) Implementing automata (London, ON, 1997). Theoret. Comput. Sci. 231 (2000), no. 1, 129-139.  ...  Among others, the equiv- alence problems of deterministic multitape finite automata and deterministic pushdown automata were the most important open problems for several decades until they were solved  ... 

Page 4257 of Mathematical Reviews Vol. , Issue 84j [page]

1984 Mathematical Reviews  
Démési (Debrecen) Pevac, Irena(YU-BELG) 84j:68037 On state reduction in deterministic finite transducers and some properties of deterministic regular translations. Publ. Inst.  ...  (D-HANN) On cofinal and definite automata. Acta Cybernet. 6 (1983), no. 2, 181-189. The authors investigate some well-known types of finite automata from the point of view of their structure.  ... 

A new complete language for DSPACE(log n)

Jian-er Chen
1989 Discrete Applied Mathematics  
An important open problem relating sequential and parallel computations is whether the space complexity on Turing machines is linearly related to the depth complexity on uniform circuits.  ...  In this paper, we discuss (log &depth many-one reducibility which is proved to be weaker than (logn)-depth Turing reducibility.  ...  On the other hand, Ladner and Fischer have given a (logn)-depth parallel implementation for one-head finite automata [S] .  ... 
doi:10.1016/0166-218x(89)90043-7 fatcat:n4oo6pliwbe2hfrcknocu4f3ei

Page 6962 of Mathematical Reviews Vol. , Issue 95k [page]

1995 Mathematical Reviews  
While finite automata generate only regular languages, cellular automata generate non- deterministic polynomial languages which may be non-regular.”  ...  (E-ZRGZ-EE; Zaragoza) Implementation of weighted place/transition nets based on linear enabling functions.  ... 

Page 710 of Mathematical Reviews Vol. , Issue 81B [page]

1981 Mathematical Reviews  
The algorithm is based on the apparatus of -par- titions and was implemented on a computer for some types of automata.  ...  Author’s summary: “Stack-counter automata are defined as one- way stack automata with a storage alphabet of just one symbol and the ability to recognize the left (bottom) and right (top) ends of the stack  ... 

ANMLzoo: a benchmark suite for exploring bottlenecks in automata processing engines and architectures

Jack Wadden, Vinh Dang, Nathan Brunelle, Tommy Tracy II, Deyuan Guo, Elaheh Sadredini, Ke Wang, Chunkun Bo, Gabriel Robins, Mircea Stan, Kevin Skadron
2016 2016 IEEE International Symposium on Workload Characterization (IISWC)  
While regular expression rulesets are valid real-world examples of use cases for automata processing, they represent a small proportion of all use cases for automata-based computing.  ...  High-performance automata-processing engines are traditionally evaluated using a limited set of regular expressionrulesets.  ...  This work was partly funded by C-FAR, one of six centers of STARnet, a Semiconductor Research Corporation program sponsored by MARCO and DARPA, Achievement Rewards for College Scientists (ARCS), Micron  ... 
doi:10.1109/iiswc.2016.7581271 dblp:conf/iiswc/WaddenDBTGSWBRS16 fatcat:v7lw5u7e55dfzkukkgjbeflznq

Page 1449 of Automation and Remote Control Vol. 53, Issue 9 [page]

1992 Automation and Remote Control  
Adamatskii UDC 62-501 .72:519.713 Sequential and parallel algorithms are proposed for computing the local transition table of the cells in deterministic cellular automata from a given sequence of configurations  ...  CA play a unique role in science and engineering: on the one hand, they model a large number of natural systems with locally interacting elements; on the other hand, they have been hardware-implemented  ... 

Page 2169 of Mathematical Reviews Vol. , Issue 82e [page]

1982 Mathematical Reviews  
The firing squad synchronization problem for graphs consists in synchronizing an arbitrary network of finite automata.  ...  These papers present results of parallelism in Turing machines. Parallelism is modelled by the notion of alternation (introduced by A. Chandra and L.  ... 
« Previous Showing results 1 — 15 out of 11,280 results