Linear Speed-Up, Information Vicinity, and Finite-State Machines
نویسنده
چکیده
Connections are shown between two properties of a machine model: linear speed-up and polynomial vicinity . In the context of the author’s Block Move (BM) model, these relate to: “How long does it take to simulate a finite transducer S on a given input z?” This question is related to the century-old problem of finding economical representations for finite groups. Under some cost measures for computing S(z), the BM enjoys the linear speed-up property, but under more-realistic measures, and subject to a reasonable but unproved hypothesis, it has the antithetical property of a constant-factor time hierarchy .
منابع مشابه
Bounded Counter Languages
We show that deterministic finite automata equipped with k two-way heads are equivalent to deterministic machines with a single two-way input head and k− 1 linearly bounded counters if the accepted language is strictly bounded, i.e., a subset of a∗1a ∗ 2 · · · a ∗ m for a fixed sequence of symbols a1, a2, . . . , am. Then we investigate linear speed-up for counter machines. Lower and upper time...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملReconfigurable Architecture Exploration for Speeding Up Execution of Code Generated from High-Level Specifications
Software generated from finite state machines targeted for standard embedded systems processors generally displays poor execution speeds. This paper evaluates an architecture that couples a standard processor with a reconfigurable unit in order to improve the execution speed of the generated code. A method for automatically partitioning the code is presented along with results obtained from sim...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کامل