Filters








23,886 Hits in 5.1 sec

Page 3216 of Mathematical Reviews Vol. , Issue 86g [page]

1986 Mathematical Reviews  
Author summary: “We deal with the following three questions concerning the power of alternation in finite automata theory: (1) What is the simplest kind of device for which alternation adds com- putational  ...  Hromkovi¢, Juraj (CS-KMSK) 86g:68042 On the power of alternation in finite automata. Mathematical foundations of computer science, 1984 (Prague, 1984), 322-329, Lecture Notes in Comput.  ... 

Page 2062 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
Secondly, they show that if one fixes the number of set quantifier alternations, the expressive power of formulas that start with a block of universal quantifiers differs from that of those that start  ...  The authors study how the alternation of (first- and monadic second-order) quantifications, on the one hand, re- lates to the dot-depth measure of two-dimensional (i.e. picture) languages, on the other  ... 

Page 4081 of Mathematical Reviews Vol. , Issue 2004e [page]

2004 Mathematical Reviews  
But if one wishes a renaissance of automata theory, then one should prefer to return to the investigation of the fundamen- tal, classical protlems of automata theory rather than searching for new applications  ...  Summary: “‘Automata theory is not over’ is the message of this paper.  ... 

Page 6995 of Mathematical Reviews Vol. , Issue 96k [page]

1996 Mathematical Reviews  
of the same power.  ...  From the text (translated from the Russian): “The equivalence problem for deterministic push-down automata (DPDA) is a key problem in the development of some parts of the theory of lan- guages and automata  ... 

Page 6323 of Mathematical Reviews Vol. , Issue 93k [page]

1993 Mathematical Reviews  
Summary: “This paper investigates the power of realtime one-way synchronized alternating one-counter automata (lsaca(1, real)s), and shows that (1) l1saca(1,real)s are more powerful than realtime one-way  ...  As a corollary of (2), we have: for each k > 1, realtime one-way synchronized alternating k-counter (k-stack-counter) automata are more powerful than realtime one-way alternating k-counter (k- stack-counter  ... 

Page 9549 of Mathematical Reviews Vol. , Issue 2003m [page]

2003 Mathematical Reviews  
The results on principal cones are within the theory de- veloped in [W. Kuichand A. K. Salomaa, Semirings, automata, lan- guages, Springer, Berlin, 1986; MR 87h:68093 (Section 9)].  ...  Analogous results are given for automata working on formal power series and for tree automata working on tree series: (i) The equivalence problem for two m-ambiguous finite automata (resp. m-ambiguous  ... 

Page 404 of Mathematical Reviews Vol. , Issue 93a [page]

1993 Mathematical Reviews  
Summary: “It is well known that four-way two-dimensional al- ternating finite automata are more powerful than three-way two- dimensional alternating finite automata, which are more powerful than two-way  ...  alternating finite automata.  ... 

Page 3880 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
It is proved that real time alternation in cellular automata is strictly more powerful than real time alternation in Turing machines with only one read-write tape.  ...  Researchers in the theory of automata, near-rings, error-correcting codes and applications of block designs will find this survey of in- terest.  ... 

Omega Automata and its Classes

Natasha Singh, Ajay Kumar
2018 Current Science  
In addition, this paper also summarizes the applicability of omega automata in various interdisciplinary fields.  ...  A variety of conditions are used to represent the set of accepting strings in ω-automata. This paper summarizes various types of ω-automata, their transition functions and accepting conditions.  ...  They characterized the classes of alternating automata into four categories based on acceptance conditions. One of the acceptance conditions increases its power in comparison to non-deterministic.  ... 
doi:10.18520/cs/v115/i11/2042-2051 fatcat:byu5hbxpnbaclbp2rkx3qa6uhm

Adding Monotonic Counters to Automata and Transition Graphs [chapter]

Wong Karianto
2005 Lecture Notes in Computer Science  
We show that, for linearbounded automata, this extension does not increase the language recognition power.  ...  We analyze models of infinite-state automata extended by monotonic counting mechanisms, starting from the (finite-state) Parikh automata studied by Klaedtke and Rueß.  ...  Introduction The idea of counting devices is a classical one in automata theory.  ... 
doi:10.1007/11505877_27 fatcat:vj4uyqzbf5fnvak6i2ijsfulmq

Page 8169 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
Summary: “Automata and machines in an arbitrary category of autonomous algebras are investigated by using the theory of Q- rings.  ...  Although macro forest transducers are more powerful, the complexity of inverse type in- ference, i.e., computing the pre-image of a recognizable language, is almost the same as for tree transducers.” 68Q  ... 

Complementation of Coalgebra Automata [chapter]

Christian Kissig, Yde Venema
2009 Lecture Notes in Computer Science  
This coalgebraic perspective on automata lays foundation to a universal theory of automata operating on infinite models of computation.  ...  Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems.  ...  We are grateful to Alessandra Palmigiano and one of the anonymous reviewers for suggesting a simplification of a definition, and to the anonymous reviewers in general for their comments.  ... 
doi:10.1007/978-3-642-03741-2_7 fatcat:rtildjippnbxxnqnberkyeolwy

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  
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.  ...  Thus, it can be argued that it is a complete hierarchy that covers, in a continuous way, all the models of automata that are important in the theory of computation.  ...  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 4243 of Mathematical Reviews Vol. , Issue 81J [page]

1981 Mathematical Reviews  
e can y the power tapes, ate on 2-way ces in ations shown il-time a finite vells and ction of structure nsider a h cell is stem art he set ol roup.  ...  Authors’ summary: “In applications of the theory of automata to large-scale systems the theory of decomposition is important.  ... 

Page 5387 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
One of the central problems in the theory of Rédding automata is the problem of completeness, formulated by Rédding, which has remained open until recently.  ...  In addition, the complexity of the algorithms is independent of the time constants. Next, we give graphical necessary and sufficient conditions for timed automata to be RQ alternating.  ... 
« Previous Showing results 1 — 15 out of 23,886 results