A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We present properties of multihead two-way probabilistic finite automata that parallel those of their deterministic and nondeterministic counterparts. ... Next, we represent logspace probabilistic complexity classes as proper hierarchies based on corresponding multihead two-way probabilistic finite automata, and we show their (deterministic Iogspace) reducibility ... We prove that several relations that hold for deterministic and nondeterministic complexity classes remain true for probabilistic complexity classes as well. ...doi:10.1007/3-540-59175-3_103 fatcat:l37vry5hunb3nk5dghikepjwia
Lecture Notes in Computer Science
Additionally, we discuss parallel composition for the presented types of systems, augmenting the map of probabilistic automata with closedness under this compositional operator. ... We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. ... of parallel composition on probabilistic automata. ...doi:10.1007/978-3-540-24611-4_1 fatcat:z7ci5kvndrdspi2nnr2xqhii3e
This paper represents a brief survey of the author’s results on different classes of probabilistic and deterministic finite automata, comparing their computing power. ... closure of the set of the languages recognizable by 2-type finite deterministic automata. ...
Cellular Automata - Innovative Modelling for Science and Engineering
Using the power of quantum computation and quantum parallelism, the complexity of these structures can be decreased dramatically (Perez-Delgado and Cheung, 2005) . ... The classical automata is deterministic and the state of the cells depends on the states of the neighbouring cells. The state of the automata is determined by the state of all its cells. ... The self-organizing processes of the network can be modelled as many cellular automata in parallel, which permute the cells and apply the rules in parallel for many cells. ...doi:10.5772/15750 fatcat:i6hajfibdjg4nkmn4ow5jmehuq
If we represent these automata by logic circuits, then the complexity of a proba- bilistic automaton is not less than that of a deterministic one. ... “We show that all the known results on representation of lan- guages in finite probabilistic automata by isolated and nonisolated points of a cross-section and the zero point of the cross-section, whose ...
A running time advantage over deterministic Turing machines is proved, and unimprovability of probabilistic running time is proved as well. ... In this theorem the author gives a lower bound for the number of linear automata from which, by means of a sequential and parallel decomposition, it is possible to construct an automa- ton M that realizes ...
For each log-space complexity class, we decompose it into a hierarchy based on corresponding multihead two-way nite automata and we (eventually) prove the separation of the hierarchy levels (even over ... and one-way one-counter nite automata with probabilistic (probabilistic and nondeterministic) states. ... The parallel relations for the settings of deterministic and nondeterministic computations can be found in Ha72]. ...doi:10.1137/s0097539796298339 fatcat:rmejwvw7irbpllyy4f57yvkffa
based on corresponding multihead two-way probabilistic finite automata, (iii) a deterministic logspace reduc- tion of logspace probabilistic complexity classes to the second lev- els of these hierarchies ... —or, equivalently, from the set of rational numbers from [0, 1j}—and the probabilistic automata with transition probabilities from the set of real numbers from [0, 1]. ...
Automation and Remote Control
In this paper, we discuss sequential and parallel identification algorithms for multidimensional deterministic CA and evaluate the complexity of identification by a Turing machine and by a systolic tree ... 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 ...
Oyamaguchi, Michio; Honda, Namio 80f:68094 The decidability of equivalence for deterministic stateless pushdown automata. Inform. and Control 38 (1978), no.3, 367-376. ... Authors’ summary: “The language recognition abilities of several two-dimensional tape automata are discussed from the standpoint of tape complexities. ...
Properties of' (unbounded-error) probabilistic as well as "probabilistic plus nondeterministic" pushdown automata and auxiliary pushdown automata are studied. ... Also, complexity lower bounds are given for the classes of languages recognized by these automata with unlimited running time. ... Acknowledgements The first author is grateful to Eric Allender for enjoyable discussions on this topic. ...doi:10.1016/s0304-3975(98)00059-0 fatcat:wblsfvu4urfxhj4p2vz3pjopiy
The general result: The complexity of stochastic automata needed to recognize a given language is usually below the complexity of deterministic automata needed for the same problem. ... Peter Clote (1-BSTC-C) 93b:68060 68Q75 68Q05 68Q45 68Q70 Freivalds, RiisinS (LA-LATV) Complexity of probabilistic versus deterministic automata. ...
, while as a complexity measure the combined complexity measure—the product of time and space—is considered. ... Downward separation results, routine and plentiful in the litera- ture, show that the separation of classes of high complexity implies the separation of classes of low complexity. ...
We present a complete picture of decidability for such automata, and even an almost-complete picture of computational complexity, for the probabilistic questions we consider. ... We show that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics. ... Our results establish a sharp contrast of the decidability and complexity of the classical questions (of emptiness and universality) and the probabilistic questions for deterministic automata (see Tables ...arXiv:1604.06764v3 fatcat:jbhgknsbtrfedlk5nfr323hryi
The question is interesting even in the case of one-head one-way probabilistic nite automata (PFA). ... Given a description of a probabilistic automaton (one-head probabilistic nite automaton or probabilistic Turing machine) and an input string x of length n, we ask how much space does a deterministic Turing ... depending on the probabilistic Turing machine. ...doi:10.1137/s0097539793253851 fatcat:afmxsmyccfd25ctwpy2mcyn6za
« Previous Showing results 1 — 15 out of 5,186 results