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
Communication Complexity Method for Measuring Nondeterminism in Finite Automata
2002
Information and Computation
Preserved Fulltext
One such problem area is the study of different measures of nondeterminism in finite automata and the estimation of the sizes of minimal nondeterministic finite automata. ...
In this paper the concept of communication complexity is applied in order to achieve progress in this problem area. The main results are as follows: 1. ...
Section 4 studies the relation between different measures of nondeterminism in finite automata and presents the remaining results. ...
doi:10.1006/inco.2001.3069
fatcat:nyy2i4hhnjag7lddmrgncbvvim
Remembering Chandra Kintala
2010
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2010 pre-print arXiv:1008.1665v1 fatcat:kqai53ly7jd4lii7yzxnqw4fxq
and limited resources for machines. ...
Kintala who passed away in November 2009. ...
The quantitative measures in [33] were later augmented by qualitative measures for the reliability of Finite Automata in [35] . ...
doi:10.4204/eptcs.31.4
fatcat:qdaeaiqhd5g5vmnvgn523kfmvu
Ambiguity, Nondeterminism and State Complexity of Finite Automata
2017
Acta Cybernetica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper surveys work on the degree of ambiguity and on various nondeterminism measures for finite automata. ...
In particular, we focus on state complexity comparisons between NFAs with quantified ambiguity or nondeterminism. ...
General background on degrees of ambiguity and limited nondeterminism for finite automata can be found in [10, 13, 16, 41] . ...
doi:10.14232/actacyb.23.1.2017.9
fatcat:zoahl3ij65bhbpms5d24xkc4i4
Some contributions of the study of abstract communication complexity to other areas of computer science
1999
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
, and for the development of some kind of secure communication protocols in the practice ...
Here, we concentrate on the applications of communication complexity for the study of several fundamental computing models, for the comparison of the power of deterministic, and probabilistic computations ...
To mention at least one of them let us consider finite automata whose size is related to one-way communication complexity. ...
doi:10.1145/333580.333587
fatcat:uh26qnj3ozhv5e35qccvdszuje
Page 5795 of Mathematical Reviews Vol. , Issue 2001H
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
of nondeterminism in finite automata. ...
One such problem area is the study of different measures of nondeterminism in finite automata. ...
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
2004
Journal of computer and system sciences (Print)
Preserved Fulltext
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.
(iii) There is a strong hierarchy based on the number of computations (as measure of the degree of nondeterminism) for three-way two-dimensional finite automata. ...
An exponential gap between nondeterminism and Las Vegas seems to be typical for all known results (one-way finite automata [4], two-and one-way communication complexity [2, 4, 11, 20, 25, 28] , and OBDDs ...
Acknowledgments We thank the unknown referees whose comments and suggestions were very helpful for improving the presentation of this paper. ...
doi:10.1016/j.jcss.2003.11.007
fatcat:yq72sn335zgkfoixsuo432qbge
Page 4219 of Mathematical Reviews Vol. , Issue 99f
[page]
1999
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
It was shown in Hansson’s book [op. cit.] that model checking for TPCTL has exponential time complexity, the latter being measured in terms of the size of the formula, the size of the transition system ...
Complexity of automata that compute the values of formulas. (Russian. Russian summary)
Vestnik Moskov. Univ. Ser. 1 Mat. Mekh. 1996, no. 4, 22-24, 110; translation in Moscow Univ. Math. ...
Measures of Nondeterminism in Finite Automata
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
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.
One such problem area is the study of di erent measures of nondeterminism in nite automata and the estimation of the sizes of minimal nondeterministic nite automata. ...
In this paper the concept of communication complexity is applied in order to achieve progress in this problem area. The main results are as follows: 1. ...
Degrees of Nondeterminism in Finite Automata It is easy to see that advice A (n) leaf A (n) 2 O(advice A (n)) and also that ambig A (n) leaf A (n) for every nfa A. ...
doi:10.1007/3-540-45022-x_17
fatcat:5hvttgikdvbp5owdyh2godtwza
Page 4493 of Mathematical Reviews Vol. , Issue 87h
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Since L is recognized by a
two-way deterministic two-head finite automaton working in linear
time we obtain, for two-way finite automata, that time, reading heads, and nondeterminism as resources cannot ...
Summary: “We describe an application of the method of ‘threads’
to obtain a lower bound for the essential complexity of Turing
computations.” {Part I has been reviewed [MR 57 #14600].} ...
Partial Order Methods for Statistical Model Checking and Simulation
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We are grateful to Christel Baier (TU Dresden) for the initial inspiration to combine partial order methods with simulation and to Pedro R. ...
D'Argenio (UNC Cordoba) for fruitful discussions and insights. ...
were measured. ...
doi:10.1007/978-3-642-21461-5_4
fatcat:or3ctmrr45apbgbzkxllgpix4y
Complexity of multi-head finite automata: Origins and directions
2011
Theoretical Computer Science
Preserved Fulltext
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.
During the past decade descriptional complexity has gained some new interest in the theoretical computer science community and became a widespread area. ...
Multi-head finite automata were introduced and first investigated by Scott in 1964 and Rosenberg in 1966. ...
Here we ask for the descriptional complexity of k-head finite automata. ...
doi:10.1016/j.tcs.2010.08.024
fatcat:yjkjor7r5rawrjijnxihcdnuve
Page 4568 of Mathematical Reviews Vol. , Issue 98G
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We investigate the power of Las Vegas computation for the complexity measures of one-way communication, finite automata and polynomial-time relativized Turing machine computation. ...
(CH-GENV-CI; Geneva); Schnitger, Georg (D-FRNK-I; Frankfurt am Main) Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations. ...
Page 2061 of Mathematical Reviews Vol. , Issue 2003C
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(D-FRNK-I; Frankfurt am Main);
Schnitger, Georg (D-FRNK-I; Frankfurt am Main)
Communication complexity method for measuring nondeterminism in finite automata. ...
The paper contains a number of results on the power of nonde- terminism in finite automata obtained by applying the concept of communication complexity. ...
Page 3730 of Mathematical Reviews Vol. , Issue 81I
[page]
1981
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Tucker, A char- acterisation of computable data types by means of a finite equa- tional specification method (pp. 76-90); Piotr Berman, A note on sweeping automata (pp. 91-97); D. ...
Koubek, Testing of properties of finite algebras (pp. 273-281); Jim Gray, A transaction model (pp. 282-298); Matthew Hennessy and Robin Milner, On observing nondeterminism and concurrency (pp. 299-309) ...
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems
2009
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2009 pre-print arXiv:0906.3051v1 fatcat:3gzcsrovffgdpkckdfsvumv2ci
Multi-head finite automata were introduced in (Rabin, 1964) and (Rosenberg, 1966). ...
for example, emptiness, finiteness, universality, equivalence, etc. ...
Let E 1 and E 2 be two descriptional systems, and c be a complexity measure for E 1 and E 2 . ...
doi:10.4204/eptcs.1.9
fatcat:gdxlz36uczhghkxhtxhiatw2ja
« Previous
Showing results 1 — 15 out of 1,151 results