Filters








888 Hits in 4.7 sec

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

2000 Mathematical Reviews  
and universality of Moore tree automata.  ...  The authors invent a class of tree automata with output for the sole recognizable purpose of extending some well-known results on distinguishability of states, simulation and universality of sequen- tial  ... 

Page 719 of Mathematical Reviews Vol. 53, Issue 2 [page]

1977 Mathematical Reviews  
From this and the author’s previous results (and known properties of tree automata), effective proce- dures for deciding emptiness, finiteness, equivalence, and inclusion for wBA’s can be developed.  ...  For the case of real time, the simulating automaton given here requires fewer states per cell than do other simulating automata described in the literature.  ... 

Cellular automata as a paradigm for ecological modeling

P. Hogeweg
1988 Applied Mathematics and Computation  
Finally we discuss some shortcomings of the cellular-automaton formalism and mention some extensions and generalizations which may remedy these shortcomings. 2. CELLULAR AUTOMATA 2.  ...  We review cellular automata as a modeling formalism and discuss how it can be used for modeling (spatial) ecological processes.  ...  In the flamboyant words of Fredkin [14] : "the universe is the most efficient simulation of the universe in the eye of God."  ... 
doi:10.1016/0096-3003(88)90100-2 fatcat:pmvygh5pw5gc7ds6pry2revt7y

Surprising Areas in the Quest for Small Universal Devices

Maurice Margenstern
2009 Electronical Notes in Theoretical Computer Science  
Our study concerns three main areas: Turing machines, cellular automata and hyperbolic cellular automata. The common thread is the quest for small universal devices.  ...  Now, with the Moore neighbourhood, two states are enough to construct a universal cellular automaton: it is a result of Berlekamp, Conway and Gay who prove the universality of the famous game of life,  ...  , not only cellular automata are universal but they have this property with already a rather low number of states: using a universal TM with 4 states and 6 symbols, there is a universal CA on the line  ... 
doi:10.1016/j.entcs.2008.12.075 fatcat:gyixdnqu5jbyzakchzffan4etq

Quantitative simulations by matrices

Natsuki Urabe, Ichiro Hasuo
2017 Information and Computation  
Furthermore, an extension to weighted tree automata is presented and implemented.  ...  We introduce notions of simulation between semiring-weighted automata as models of quantitative systems.  ...  Wachter for the user support of the tool apex.  ... 
doi:10.1016/j.ic.2016.03.007 fatcat:mrulo2pw7ve7haflnszt2eansa

Robust Satisfaction [chapter]

Orna Kupferman, Moshe Y. Vardi
1999 Lecture Notes in Computer Science  
We show that the complexity of the problem is EXPTIME-complete for CTL and the -calculus, and is 2EXPTIME-complete for CTL ? .  ...  We partition branching temporal logic formulas into three classes: universal, existential, and mixed formulas. We show that each class has different sensitivity to the robustness requirement.  ...  We distinguish between two cases. If is universal, then, as M simulates MkM 0 for every (possibly nondeterministic) M 0 , robust satisfaction coincides with usual satisfaction and we are done.  ... 
doi:10.1007/3-540-48320-9_27 fatcat:n37pabvq6nfslby4edkeiioxkq

Using theoretical computer simulators for formal languages and automata theory

Carlos I. Chesñevar, María L. Cobo, William Yurcik
2003 ACM SIGCSE Bulletin  
Both formal languages and automata theory (FLAT) are core to the CS curricula but are difficult to teach and to learn.  ...  This situation has motivated the development of a number of theoretical computer simulators as educational tools to allow students to "bring to life" many topics that traditionally were presented only  ...  Acknowledgments The authors want to thank Professor Jürgen Dix (University of Manchester, UK) for his comments on the use of busy beaver functions as additional motivation when teaching Turing machines  ... 
doi:10.1145/782941.782975 fatcat:jgl47n7ykrbkdcescfu2fybv2e

Turning automata theory into a hands-on course

Susan H. Rodger, Bart Bressler, Thomas Finley, Stephen Reading
2006 ACM SIGCSE Bulletin  
Thus, students explore the formal languages and automata concepts computationally and visually with JFLAP, and theoretically without JFLAP.  ...  We present a hands-on approach to problem solving in the formal languages and automata theory course.  ...  Language Emulator [9] is a toolkit for a number of forms of regular languages including Moore and Mealy machines, and many types of translations between the forms.  ... 
doi:10.1145/1124706.1121459 fatcat:4fqiinsphve6ngtgqccdvo2cse

Turning automata theory into a hands-on course

Susan H. Rodger, Bart Bressler, Thomas Finley, Stephen Reading
2006 Proceedings of the 37th SIGCSE technical symposium on Computer science education - SIGCSE '06  
Thus, students explore the formal languages and automata concepts computationally and visually with JFLAP, and theoretically without JFLAP.  ...  We present a hands-on approach to problem solving in the formal languages and automata theory course.  ...  Language Emulator [9] is a toolkit for a number of forms of regular languages including Moore and Mealy machines, and many types of translations between the forms.  ... 
doi:10.1145/1121341.1121459 dblp:conf/sigcse/RodgerBFR06 fatcat:4gyswaadfzgbhd2ts4p532ftyu

Sequential synthesis using S1S

A. Aziz, F. Balarin, R.K. Brayton, A. Sangiovanni-Vincentelli
2000 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
We also describe control aspects of sequential synthesis and relate controller realizability to classical work on program synthesis and tree automata.  ...  We will show that this leads to simple and mathematically elegant solutions to problems arising in the synthesis and optimization of synchronous digital hardware.  ...  Singhal for his help with developing the notation used in this paper, and the reviewers for their detailed feedback.  ... 
doi:10.1109/43.875301 fatcat:eovj2exdcnchvlf6ffvcxo35yq

Minimization of Automata [article]

Jean Berstel and Luc Boasson and Olivier Carton and Isabelle Fagnot
2010 arXiv   pre-print
In particular, we show that it is not possible to simulate the computations of one of the algorithm by the other. We describe the minimization algorithm by fusion for so-called local automata.  ...  This chapter is concerned with the design and analysis of algorithms for minimizing finite automata.  ...  We thank Narad Rampersad for his careful reading of the text.  ... 
arXiv:1010.5318v3 fatcat:4lxdihuhczdrxminetydrzovba

The Logic of Automata---Part I

Arthur W. Burks, Hao Wang
1957 Journal of the ACM  
ion an, ical ita- The Logic of Automata*—Part I Artutr W. Burks anp Hao Wanc University of Michigan, Ann Arbor, Mich. 1.  ...  An automaton is strongly connected if THE LOGIC OF AUTOMATA—PART I 217 and only if fqr any ordered pair of states < S;,S; > (i may be equal to j), we can pass ‘roi S; on the tree to S; on the tree by a  ... 
doi:10.1145/320868.320880 fatcat:ixqkwuchgfahpkwqjguvguvjly

The theory of interacting local automata

Armen Gabrielian
1970 Information and Control  
Local automata are defined as labeled monadic algebras that interact and accept or reject each other. The relationship between deterministic and nondeterministic local automata is established.  ...  Then the algebraic closure properties of acceptable classes of structures in terms of homomorphisms, direct products, and reduced products are studied.  ...  BASIC PROPERTIES OF ACCEPTABLE CLASSES OF STRUCTURES Both standard automata and tree automata have acceptable classes of structures which are closed with respect to the Boolean operations of union, intersection  ... 
doi:10.1016/s0019-9958(70)90186-5 fatcat:hrp3ioi66jbklde2jepdi2l2vi

A brief history of cellular automata

Palash Sarkar
2000 ACM Computing Surveys  
Cellular automata are simple models of computation which exhibit fascinatingly complex behavior.  ...  The work should be of interest to both new entrants into the field as well as researchers working on particular aspects of cellular automata.  ...  Comments and suggestions from anonymous referees helped in improving the presentation and treatment of several topics.  ... 
doi:10.1145/349194.349202 fatcat:llv74746vnbwxcslsvadfiv4xi

A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications [article]

Kamalika Bhattacharjee, Nazma Naskar, Souvik Roy, Sukanta Das
2018 arXiv   pre-print
Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation.  ...  In this survey, we tour to the various types of CAs introduced till date, the different characterization tools, the global behaviors of CAs, like universality, reversibility, dynamics etc.  ...  Acknowledgements The authors gratefully acknowledge the anonymous reviewers for their comments and suggestions, which have helped to improve the quality and readability of the paper.  ... 
arXiv:1607.02291v3 fatcat:nvvcvjlupvdtpdz34kii2ovt5m
« Previous Showing results 1 — 15 out of 888 results