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 `application/pdf`

.

## Filters

##
###
Multihead two-way probabilistic finite automata
[chapter]

1995
*
Lecture Notes in Computer Science
*

We present properties

doi:10.1007/3-540-59175-3_103
fatcat:l37vry5hunb3nk5dghikepjwia
*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. ...##
###
Probabilistic Automata: System Types, Parallel Composition and Comparison
[chapter]

2004
*
Lecture Notes in Computer Science
*

Additionally, we discuss

doi:10.1007/978-3-540-24611-4_1
fatcat:z7ci5kvndrdspi2nnr2xqhii3e
*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*. ...##
###
Page 2128 of Mathematical Reviews Vol. , Issue 83e
[page]

1983
*
Mathematical Reviews
*

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*. ...##
###
Quantum Cellular Automata Controlled Self-Organizing Networks
[chapter]

2011
*
Cellular Automata - Innovative Modelling for Science and Engineering
*

Using

doi:10.5772/15750
fatcat:i6hajfibdjg4nkmn4ow5jmehuq
*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. ...##
###
Page 435 of Mathematical Reviews Vol. , Issue 87a
[page]

1987
*
Mathematical Reviews
*

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 ...##
###
Page 321 of Mathematical Reviews Vol. , Issue 82a
[page]

1982
*
Mathematical Reviews
*

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 ...##
###
On the Structure of Logspace Probabilistic Complexity Classes

2000
*
SIAM journal on computing (Print)
*

For each log-space

doi:10.1137/s0097539796298339
fatcat:rmejwvw7irbpllyy4f57yvkffa
*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]. ...##
###
Page 7116 of Mathematical Reviews Vol. , Issue 97K
[page]

1997
*
Mathematical Reviews
*

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]. ...##
###
Page 1449 of Automation and Remote Control Vol. 53, Issue 9
[page]

1992
*
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 ...##
###
Page 2375 of Mathematical Reviews Vol. , Issue 80F
[page]

1980
*
Mathematical Reviews
*

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 probabilistic pushdown automata

1998
*
Theoretical Computer Science
*

Properties

doi:10.1016/s0304-3975(98)00059-0
fatcat:wblsfvu4urfxhj4p2vz3pjopiy
*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. ...##
###
Page 1036 of Mathematical Reviews Vol. , Issue 93b
[page]

1993
*
Mathematical Reviews
*

*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*. ...

##
###
Page 3949 of Mathematical Reviews Vol. , Issue 92g
[page]

1992
*
Mathematical Reviews
*

, 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*. ...##
###
Quantitative Automata under Probabilistic Semantics
[article]

2019
*
arXiv
*
pre-print

We present a complete picture

arXiv:1604.06764v3
fatcat:jbhgknsbtrfedlk5nfr323hryi
*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 ...##
###
Space-Efficient Deterministic Simulation of Probabilistic Automata

1998
*
SIAM journal on computing (Print)
*

*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. ...

« Previous

*Showing results 1 — 15 out of 5,186 results*