34,377 Hits in 4.5 sec

Interacting Automata for Modelling Distributed Systems [chapter]

Irina A. Lomazova
2003 Lecture Notes in Computer Science  
A community of interacting automata is a set of nondeterministic finite automata which can execute actions autonomously, synchronize with each other, or generate new members of the community.  ...  We show that the formalism of interacting automata has a clear semantics and nice semantic properties, leading to decidability of some important behavioral properties of modelled systems.  ...  The visible actions of the automata community, generated by the automaton A, are actions a and b. During the life cycle of this automata community the unlimited number of copies of A can appear.  ... 
doi:10.1007/3-540-44862-4_92 fatcat:ktap2znwmvcydmx57yatb72xqq

Quantum inductive inference by finite automata

R. Freivalds, R.F. Bonner
2008 Theoretical Computer Science  
We introduce quantum limited memory inductive inference machines as quantum finite automata acting as inductive inference machines.  ...  Freivalds and Smith [R. Freivalds, C.H.  ...  Acknowledgment The first author's research was supported by Grant No. 05.1528 from the Latvian Council of Science, Contract IST-1999-11234 (QAIP) from the European Commission, and the Swedish Institute  ... 
doi:10.1016/j.tcs.2008.02.023 fatcat:4vvokuge2fb3blvri2clio77za

Page 1279 of AT&T Technical Journal Vol. 39, Issue 5 [page]

1960 AT&T Technical Journal  
A finite number of internal states q,q: , ii. An alphabet of two symbols: so = 0, 8; l. iii. A map M whose domain and range are both subsets of the set of state-symbol pairs.  ...  AUTOMATA AND FINITE AUTOMATA ' 1 { Vv. FINITE AUTOMATA There is a subfamily of T-machines that are abstract models of a class of switching circuits called sequential circuits.  ... 

Small Sweeping 2NFAs Are Not Closed Under Complement [chapter]

Christos A. Kapoutsis
2006 Lecture Notes in Computer Science  
That is: does nondeterminism make a difference on two-way finite automata that use only a "small" (i.e., polynomial) number of states?  ...  In 1978, Sakoda and Sipser proposed the following analogue to these questions: instead of full-fledged Turing machines, focus only on those which cannot write on their tape; instead of time or space, focus  ...  That is: does nondeterminism make a difference on two-way finite automata that use only a "small" (i.e., polynomial) number of states?  ... 
doi:10.1007/11786986_14 fatcat:lijkmx7n3jev7jpxjogf7umjpm

The Power of Writing, a Pebble Hierarchy and a Narrative for the Teaching of Automata Theory

Carolina Mejía, J. Andres Montoya, Christian Nolasco
2018 Electronical Notes in Theoretical Computer Science  
The hierarchy begins at the level of finite state automata (0-pebble automata) and approaches the model of onetape Turing machines.  ...  We investigate the use of this hierarchy as a narrative for the teaching of automata theory. We also investigate some fundamental questions concerning the power of pebble automata.  ...  The first author would like to thank COLCIENCIAS for the grant confered, and which allows her to develop her ph.D studies.  ... 
doi:10.1016/j.entcs.2018.06.007 fatcat:xqyxo6gzereo5imw5ohmvxs2da

Page 322 of Mathematical Reviews Vol. , Issue 82a [page]

1982 Mathematical Reviews  
The authors consider the operation of the periodic sum of finite automata. The relation between properties of finite automata and  ...  [Migdowicz, Zadzistaw B.] 82a:68 104 Strong connectivity of periodic sums of finite automata. (Russian) Automata theory in application to the design of discrete devices and systems (Proc.  ... 

Page 5145 of Mathematical Reviews Vol. , Issue 85k [page]

1985 Mathematical Reviews  
empty set of symbols (a subset of a finite alphabet) and the generator adds a symbol to the set under the writing head (i.e., if the symbol is already in the set, the contents of the cell remain unchanged  ...  However, in the latter case there is no way for a two- way automaton to keep track of the number of copies of z and z® in order to know when the simulated one-way automaton sees an endmarker.  ... 

P Systems and Finite Automata

Xian Xu
2007 First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)  
We give the concept of P system with string objects and finite automata, describe the implementation details, and finally make some future work expectation.  ...  We apply P systems with string objects (worms) to implement finite automata, that is, simulating their running, showing that P systems with string objects can properly hold the computability of finite  ...  For instance, from the example above we can construct finite automata recognizing strings having an even number of a's, an even number of a's and an odd number of b's, a's whose number is 3n(n = 1, 2,  ... 
doi:10.1109/cisis.2007.44 dblp:conf/cisis/Xu07 fatcat:lryedpy5lndgnfnh5wrhrd4xsa

Categorizing Automata by W-Machine Programs

C. Y. Lee
1961 Journal of the ACM  
the class of finite automata.  ...  On computable numbers, with an application to the Entscheidungs- problem. Proc. London Math. Soc. 24 (1936), 230-265. , 3. Leg, C. Y. Automata and finite automata.  ... 
doi:10.1145/321075.321082 fatcat:hjt263qojzfy7ax2rrz54aek4i

Turing Machine and Automata Simulators

Mohamed Hamada
2013 Procedia Computer Science  
The twofold contribution of this work is a novel use of modern technology to improve learning and a longitudinal experimental evaluation of its use in context.  ...  This paper introduces a Turing machine and pushdown automata simulators as a virtual environment for learning computational models and automata theory.  ...  Learners can write their machine in the input window, and then write the input of the machine on the (infinite) tape.  ... 
doi:10.1016/j.procs.2013.05.314 fatcat:dlembbhh25gk3jur57v3wrlxa4

The power of two-way deterministic checking stack automata

Joost Engelfriet
1989 Information and Computation  
The easy proof is based on the closure under inverse deterministic two-way GSM mappings of the deterministic two-way two-head finite automaton languages.  ...  We show that deterministic two-way checking stack automata have the same power as deterministic two-way two-head finite automata.  ...  Since T is deterministic, all qj are distinct, and hence the number of possible visiting sequences is finite. Now let W be the string s1 ".s,, i.e., w together with the visit information of T.  ... 
doi:10.1016/0890-5401(89)90015-1 fatcat:g2xzyan2efam5iprqecbys3suy

Decidability and Complexity Results for Timed Automata via Channel Machines [chapter]

Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell
2005 Lecture Notes in Computer Science  
This reveals a surprising divergence between the theory of timed automata over finite words and over infinite words.  ...  However, the status of the problem when A has one clock is not determined by [5] .  ...  We write T Σ * for the set of finite timed words over alphabet Σ and T Σ ω for the set of infinite timed words over alphabet Σ. Let X be a finite set of clocks, denoted x, y, z, etc.  ... 
doi:10.1007/11523468_88 fatcat:yaagqhcd6ncvbc7ri5gptos5uq

Page 299 of Mathematical Reviews Vol. 45, Issue 1 [page]

1973 Mathematical Reviews  
A second theorem provides similar relations for two-way stack automata, two-way multi-head pusndown automata, and writing pushdown acceptors, both deter- ministic and non-deterministic.  ...  F. 1691 Minimization of the number of states of partially deter- mined asynchronous finite automata. (Russian) Avtomat. i Vyéisl. Tehn. 1970, no. 4, 1-7.  ... 

Page 157 of Automation and Remote Control Vol. 21, Issue 2 [page]

1960 Automation and Remote Control  
Of course, in a finite automaton, the number of possi- ble output states may, but in general does not, coincide + In particular, one can number the automata and input states.  ...  Then, the state and input alphabets would be com- prised of sets of numbers, 1,2,...,k and 1,2,...,r. Such alphabets might be convenient in investigations of in- dividual automata.  ... 

Descriptional and Computational Complexity of Finite Automata [chapter]

Markus Holzer, Martin Kutrib
2009 Lecture Notes in Computer Science  
Mostly, we discuss developments relevant to finite automata related problems like, for example, (i) simulation of and by several types of finite automata, (ii) standard automata problems such as, e.g.,  ...  Over the last half century, a vast literature documenting the importance of deterministic, nondeterministic, and alternating finite automata as an enormously valuable concept has been developed.  ...  identify the logical values false and true with 0 and 1 and write {0, 1} Q for the set of finite functions from Q into {0, 1}, and {0, 1} {0,1} Q for the set of Boolean formulas (functions) mapping {0,  ... 
doi:10.1007/978-3-642-00982-2_3 fatcat:zacz7ijk2vajxkeqzlw25goe74
« Previous Showing results 1 — 15 out of 34,377 results