141 Hits in 1.9 sec

Amount of nonconstructivity in deterministic finite automata

Rūsiņš Freivalds
2010 Theoretical Computer Science  
We study the problem of the quantitative characterization of the amount of nonconstructiveness in nonconstructive arguments. We limit ourselves to computation by deterministic finite automata.  ...  The notion of nonconstructive computation by finite automata is introduced. Upper and lower bounds of nonconstructivity are proved.  ...  In this paper we prove several upper and lower bounds for the amount of nonconstructivity in nonconstructive deterministic finite 2-way automata.  ... 
doi:10.1016/j.tcs.2010.05.038 fatcat:f5ekr4cwezfy3hdrd3ud6tb6fu

On the Amount of Nonconstructivity in Learning Recursive Functions [chapter]

Rūsiņš Freivalds, Thomas Zeugmann
2011 Lecture Notes in Computer Science  
In the present paper, the amount of nonconstructivity in learning of recursive functions is studied.  ...  Furthermore, nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [17] and Freivalds [11] .  ...  Damm and Holzer [6] adapted the notion of advice for finite automata.  ... 
doi:10.1007/978-3-642-20877-5_33 fatcat:t5pgu265nzdgjbvanufijiva7y

Rūsiņš Mārtiņš Freivalds: Academic Genealogy and Selected Publications

Rūsiņš Mārtiņš Freivalds, Solvita Zariņa
2016 Baltic Journal of Modern Computing  
Rusins Freivalds: Amount of nonconstructivity in deterministic finite automata. "Theoretical Computer Science", 2010, vol. 411, No. 38-39, pp. 3436-3443 24.  ...  "Journal of Universal Computer Science", 2011, vol. 17, No. 6, pp. 859-873 21. Rūsiņš Freivalds, Thomas Zeugmann: On the Amount of Nonconstructivity in Learning Recursive Functions.  ... 
doi:10.22364/bjmc.2016.4.4.02 fatcat:i6z5ncr4ivcznhq3qdl65z4lnq

On the Size Complexity of Deterministic Frequency Automata [chapter]

Rūsiņš Freivalds, Thomas Zeugmann, Grant R. Pogosyan
2013 Lecture Notes in Computer Science  
First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared.  ...  Then approximations of a language are considered, where a language L is called an approximation of a language L if L differs from L in only a finite number of strings.  ...  The research was supported by Grant No. 09.1570 from the Latvian Council of Science and the Invitation Fellowship for Research in Japan S12052 by the Japan Society for the Promotion of Science.  ... 
doi:10.1007/978-3-642-37064-9_26 fatcat:4vk4iuhrnvf5toudzfzngmtgzm

On the Theory of Homogeneous Structures

V. Z. Aladyev, Thomas J. Higgins
1973 IEEE Transactions on Systems, Man and Cybernetics  
Especially noteworthy is the abundance of material presented in a very concise manner.  ...  Yet further, the content advanced in this volume is intended to serve as a basis for work in the now very active fields of coding, character recognition, and filtering.  ...  In Chapter 2, HS are presented as algorithms for rewriting words in finite alphabets.  ... 
doi:10.1109/tsmc.1973.4309291 fatcat:54kyqk43wfewxkwmpjjcqg4k3y

Page 1372 of Mathematical Reviews Vol. , Issue 85d [page]

1985 Mathematical Reviews  
The proof is nonconstructive and further studies of the problem by J.  ...  The method requires an amount of storage space which is proportional to the length of the input n.  ... 

Page 3258 of Mathematical Reviews Vol. , Issue 81H [page]

1981 Mathematical Reviews  
In the present paper we provide a proof of this fact, our proof amounting to a description of Collins’ algorithm from a theoretical point of view.  ...  A semialge- braic set S (in E’) is the set of all points of E’ satisfying some given finite Boolean combination g of polynomial equations and inequalities in r variables. @ is called a defining formula  ... 

On Nondeterministic Unranked Tree Automata with Sibling Constraints

Christof Löding, Karianto Wong, Marc Herbstritt
2009 Foundations of Software Technology and Theoretical Computer Science  
We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees.  ...  In particular, we show that the emptiness problem for the nondeterministic automata is decidable. In addition, we show that the universality problem, in contrast, is undecidable.  ...  We also thank the anonymous referees for their numerous comments and suggestions; due to space 322 UNRANKED TREE AUTOMATA WITH SIBLING CONSTRAINTS limitations, however, we were not able to include all  ... 
doi:10.4230/lipics.fsttcs.2009.2328 dblp:conf/fsttcs/LodingW09 fatcat:erthpkfrrzdwxgggp7opo4x6rm

Formal grammars and the regeneration capability of biological systems

Adrian Walker
1975 Journal of computer and system sciences (Print)  
It is also shown that, in spite of the simplicity of the models without cellular interactions, there is no algorithm which will decide for any such model whether or not it is capable of complete regeneration  ...  A definition is proposed to place such damage and regeneration in the framework of an existing formal model for biological growth and development.  ...  new automata, or die out, in a way resembling the behavior of biological cells.  ... 
doi:10.1016/s0022-0000(75)80071-7 fatcat:aq32ijwvuvcolkycsh3tmznuoe

Alternating Automata Modulo First Order Theories [chapter]

Radu Iosif, Xiao Xu
2019 Lecture Notes in Computer Science  
This provides a method for checking inclusion of timed and finite-memory register automata, and emptiness of quantified predicate automata, previously used in the verification of parameterized concurrent  ...  We introduce first-order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first-order formulae, with states and internal variables  ...  Extending finite automata to infinite alphabets has been considered in the context of symbolic alternating finite automata (s-AFA), whose transitions are labeled with guards taken from a decidable theory  ... 
doi:10.1007/978-3-030-25543-5_3 fatcat:bidjq27ybnhzdcllzjthwvygea

Dense quantum coding and quantum finite automata

Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani
2002 Journal of the ACM  
This motivates the study of quantum computation with restricted memory and no reinitialization, that is, of quantum finite automata.  ...  It was known that there are languages that are recognized by quantum finite automata with sizes exponentially smaller than those of corresponding classical automata.  ...  One-Way Quantum Finite Automata In this section, we define generalized one-way quantum finite automata, and use the techniques developed above to prove size lower bounds on GQFAs.  ... 
doi:10.1145/581771.581773 fatcat:qsrhki7q4vatrd7hlzqimxmb6i

Resolution-based approach to compatibility analysis of interacting automata

Anatoli N. Chebotarev, Marina K. Morokhovets
1998 Theoretical Computer Science  
The problem of compatibility analysis of two interacting automata arises in the development of algorithms for reactive systems if partial nondeterministic automata serve as models for both the reactive  ...  Intuitively, two interacting automata are compatible if a signal from one automaton always induces a defined transition in the other.  ...  Acknowledgements The authors thank the anonymous referees for helpful comments and constructive criticism that led to improvements in the presentation of the paper.  ... 
doi:10.1016/s0304-3975(97)00025-x fatcat:5yc3bfbo4rafpoez6i2om3wh6e

Regular Language Representations in the Constructive Type Theory of Coq

Christian Doczkal, Gert Smolka
2018 Journal of automated reasoning  
automata with verified upper bounds for the increase in size.  ...  We explore the theory of regular language representations in the constructive type theory of Coq.  ...  Acknowledgements We thank Jan-Oliver Kaiser, who was involved in our previous work on one-way automata and also in some of the early experiments with two-way automata.  ... 
doi:10.1007/s10817-018-9460-x fatcat:43r6bknxpzhhrhj5tdhn2qnb6e

The logical strength of Büchi's decidability theorem [article]

Leszek Kołodziejczyk, Henryk Michalewski, Pierre Pradic, Michał Skrzypczak
2018 arXiv   pre-print
Moreover, each of (1)-(4) implies McNaughton's determinisation theorem for automata on infinite words, as well as the "bounded-width" version of König's Lemma, often used in proofs of McNaughton's theorem  ...  We study the strength of axioms needed to prove various results related to automata on infinite words and Büchi's theorem on the decidability of the MSO theory of (N, <).  ...  Finite Wilke algebras (i.e., where both S + and S ∞ are finite) are the counterpart to finite-state Büchi automata in terms of recognisability of languages over infinite words.  ... 
arXiv:1608.07514v3 fatcat:3s6rnfri4nbbpk7sv2uxy7dayq

On the stability of some biological schemes with cellular interactions

Gabor T. Herman, Adrian Walker
1976 Theoretical Computer Science  
A model of multicellular growth in biological organisms is studied from the point of view of its ability to produce stable configurations, and the kinds oi cell lineages which may occur inside such configurations  ...  ls which may die out as a block, and be replaced by division of other cells, in one generation; a biologically reasonable property.  ...  Wet note that the proof of Theorem 6 is nonconstructive, since it makes use o ~emnna 6 whrich in turn makes use of Proposition 2.  ... 
doi:10.1016/0304-3975(76)90010-4 fatcat:tumon4jhrnf3xcrkhvtmzu4wfm
« Previous Showing results 1 — 15 out of 141 results