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
Binary decision automata are finite state machines that evaluate switching functions by means of decision rather than Boolean logic. ... The paper motivates the use of a BDM finite automaton instead of a more general model on the basis of expected case time and space complexity analysis. ... The BDM with separate output instruction and subroutine capability was shown to be the rational choice for a finite state implementation of an industrial programmable sequence controller. ...doi:10.1109/41.3116 fatcat:eurljnvzcbgebogug4fcxd5jey
The question of the state-size cost for simulation of two-way nondeterministic automata (2NFAs) by two-way deterministic automata (2DFAs) was raised in 1978 and, despite many attempts, it is still open ... The same holds for making such machines self-verifying, halting, or unambiguous. Finally, any superpolynomial lower bound for the simulation of such machines by standard 2DFAs would imply L<>NL. ... Instead of restricting the power of 2dfas to the degree for which it is already possible to derive an exponential gap between the weaker model and the standard 2nfas, we increase the power of 2dfas, towards ...arXiv:1110.1263v1 fatcat:pwp7smmdtbgw7il5sehtatxyiy
We generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition. ... A 2DC machine M is a 5-tuple (Q, Σ, q 0 , δ, F ) where Q is a finite set of states, q 0 a special start state, F ⊆ Q the set of accepting states and Σ is a finite input alphabet. δ is a mapping from Q ... A 2DC((U, G, F − )) machine M is a 6-tuple (Q, Σ, q 0 , δ, F, (U, G, F − )) where Q is a finite set of states, q 0 a special start state, F ⊆ Q the set of accepting states and Σ is a finite input alphabet ...arXiv:cs/0410057v2 fatcat:hv2v4nabjvggfizs765moxqm5a
We consider graph Turing machines, a model of parallel computation on a graph, in which each vertex is only capable of performing one of a finite number of operations. ... We further show that properties of the underlying graph have significant consequences for the power of computation thereby obtained. ... Acknowledgements The authors would like to thank Tomislav Petrović, Linda Brown Westrick, and the anonymous referees of earlier versions for helpful comments. ...arXiv:1703.09406v1 fatcat:hct5pwerv5ghvotmotfmufkacy
In this paper, we study the quantity of computational resources (state machine states and/or probabilistic transition precision) needed to solve specific problems in a single hop network where nodes communicate ... We prove a lower bound on the states required to solve this problem with a given error bound, probability precision, and (when relevant) network size lower bound. ... This node is responsible for simulating the state transitions of the finite-state control of the counter machine. ...arXiv:1508.03859v1 fatcat:r2kggcfn4jezxa4n7u6gt67r4i
The paper contribute~ to the state-of-the-art in improving the efficiency of large-scale computations. We also presen! ... Performance results are given for holh ih,~ sequential and the parallel versions of the code. The results are promising. ... Acknowledgements The authors want to thank Farhad Arbab for his suggestions to improve this paper. ...doi:10.1016/s0167-8191(98)00043-x fatcat:c5j6pksp2bg2tnskrz22l4w5uy
Several key components of Angluin's algorithm are modified so that it fits in our problem setting, and the modified algorithm also provides a reasonable partitioning of the continuous state space as a ... We validate our algorithm on a latch circuit and an integrator circuit, and demonstrate that the resulting FSMs inherit important behaviors of original circuits. ... ACKNOWLEDGMENT Chenjie Gu would like to thank Wenchao Li for the reference to  , Baruch Sterin for many useful discussions, and the anonymous reviewers for corrections and suggestions. ...doi:10.1109/aspdac.2011.5722281 dblp:conf/aspdac/GuR11 fatcat:5syjvm57drfqxdlplqzcs6pn5m
Syntactic recognition model is constructed based on the theory of finite automaton, the interpreter process every single line of NC code with high speed and high accuracy by just single scanning, the efficiency ... This paper analyse the function and structure of NC code interpreter in detail. ... Parsing process (Figure 3 ): 1) Read one line of NC code, then the working position jump into the initial state S0. 2) Read a character, according to state transfer diagram for the state transition. 3 ...doi:10.5539/mas.v6n4p38 fatcat:u4wwq5xxqfgs7mz4muu733ibca
The results of industrial tests of an automated monitoring and positioning system for functional units on one of the opencast coal mines of Kuzbass are presented. ... This article is show to the development of an automated monitoring and positioning system for functional nodes of mining technological machines. ... The given paper is completed with the support of the Ministry of Education and Science of the Russian Federation within the limits of the project part of the state assignment of TUSUR in 2017 and 2019 ...doi:10.1051/matecconf/201816103017 fatcat:yqrzounqezcfpmwc6qvliaayra
Lecture Notes in Computer Science
(Notice that this is not enough states for an individual node to store even a single pointer to the tape of the simulated machine.) ... The cost for their efficiency, however, is a loss of state optimality in some circumstances. ... This node is responsible for simulating the state transitions of the finite-state control of the counter machine. ...doi:10.1007/978-3-662-48653-5_3 fatcat:djr5pqjtbza3tehby3n72sz4ci
“The first part gives a criticism of present methods, as well as suggestions of how, building on schemes of the resolution type, one might increase their power. ... Author’s introduction: “The development of automatic theorem provers has reached an interesting stage, where on the one hand new, more powerful methods are required and at the same time current methods ...
We present the detailed design of such a power modeling scheme and its implementation on Android and Windows Mobile. ... We observe that stateof-the-art, utilization-based power modeling correlates the (actual) utilization of a hardware component with its power state, and hence is insufficient in capturing several power ... Acknowledgments We thank the program committee and reviewers for their helpful comments, and especially our shepherd, M. ...doi:10.1145/1966445.1966460 dblp:conf/eurosys/PathakHZBW11 fatcat:qx2ks75mc5dkjg6x7gsbo3x55m
The presentation of the material takes about one-week of lecture, and allows understanding of all the concepts of machine language without having to deal with the complexity of modern machine language ... We present the development and implementation of the Itty Bitty Computing Machine (IBCM), a machine language designed specifically to be taught to lower-level undergraduate students. ... Hopcroft and Ullman  define a Turing machine as a 7-tuple M = Q, Γ, b, Σ, δ, q0, F where: • Q is a finite set of states • Γ is the finite set of allowable tape symbols • b ∈ Γ is the blank symbol ...doi:10.1145/1953163.1953273 dblp:conf/sigcse/BloomfieldW11 fatcat:kqtaenlxfbhwng3fbr7dkeqxbm
On one extreme, the complexity of detecting non-trivial properties that preserve equivalence of machines, i.e., properties of the accepted language, on finite automata, can be as little as O(1). ... On the other extreme, Rice's theorem states that all such properties on Turing machines are undecidable. ... Mendelbaum for encouraging me to write this paper, and to R.B. Yehezkael, M. Lewenstein, and the referees for their helpful comments. ...doi:10.1016/j.ic.2008.10.004 fatcat:uz2arfrs75cu5p7wlcf5ti5msa
Bureau of Business Research, The Ohio State University, Columbus, Ohio, 1960. v+205 pp. $3.00. This monograph provides complete explanation of the use of the IBM 650 for large scale item analysis. ... It reports out (a) the order of the group, (b) the number of cyclic subgroups of prime power order, (c) the total number of subgroups, and (d) the number of classes of conjugate subgroups. ...
« Previous Showing results 1 — 15 out of 10,552 results