scholarly journals SOLVING THE WORD PROBLEM IN REAL TIME

2001 ◽  
Vol 63 (3) ◽  
pp. 623-639 ◽  
Author(s):  
DEREK F. HOLT ◽  
SARAH REES
Keyword(s):  
Recent Result ◽  
Real Time ◽  
Word Problem ◽  
Turing Machine ◽  
Linear Time ◽  
Nilpotent Groups ◽  
Hyperbolic Groups ◽  
Turing Machines ◽  
Geometrically Finite ◽  
Word Hyperbolic Groups

The paper is devoted to the study of groups whose word problem can be solved by a Turing machine which operates in real time. A recent result of the first author for word hyperbolic groups is extended to prove that under certain conditions the generalised Dehn algorithms of Cannon, Goodman and Shapiro, which clearly run in linear time, can be programmed on real-time Turing machines. It follows that word-hyperbolic groups, finitely generated nilpotent groups and geometrically finite hyperbolic groups all have real-time word problems.

TWO-DIMENSIONAL THREE-WAY ARRAY GRAMMARS AND THEIR ACCEPTORS

1989 ◽  
Vol 03 (03n04) ◽  
pp. 353-376 ◽  
Author(s):  
KENICHI MORITA ◽  
YASUNORI YAMAMOTO ◽  
KAZUHIRO SUGATA
Keyword(s):  
Real Time ◽  
Turing Machine ◽  
Linear Time ◽  
Two Dimensional ◽  
Turing Machines ◽  
One Dimensional ◽  
Context Sensitive

Two kinds of three-way isometric array grammars arc proposed as subclasses of an isometric monotonic array grammar. They are a three-way horizontally context-sensitive array grammar (3HCSAG) and a three-way immediately terminating array grammar (3ITAG). In these three-way grammars, patterns of symbols can grow only in the leftward, rightward and downward directions. We show that their generating abilities of rectangular languages are precisely characterized by some kinds of three-way two-dimensional Turing machines or related acceptors. In this paper. the following results are proved. First, 3HCSAG is characterized by a nondeterministic two-dimensional three-way Turing machine with space-bound n (n is the width of a rectangular input) and a nondeterministic one-way parallel/sequential array acceptor. Second, 3ITAG is characterized by a nondeterministic two-dimensional three-way real-time (or linear-time) restricted Turing machine, a nondeterministic one-dimensional bounded cellular acceptor and a nondeterministic two-dimensional one-line tessellation acceptor.

ON THE NECESSITY OF FORMAL MODELS FOR REAL-TIME PARALLEL COMPUTATIONS

2001 ◽  
Vol 11 (02n03) ◽  
pp. 353-361 ◽  
Author(s):  
STEFAN D. BRUDA ◽  
SELIM G. AKL
Keyword(s):  
Positive Integer ◽  
Real Time ◽  
Complexity Theory ◽  
Turing Machine ◽  
Formal Model ◽  
Parallel Computations ◽  
General Nature ◽  
Turing Machines ◽  
Formal Models ◽  
Language L

We assume the multitape real-time Turing machine as a formal model for parallel real-time computation. Then, we show that, for any positive integer k, there is at least one language Lk which is accepted by a k-tape real-Turing machine, but cannot be accepted by a (k - 1)-tape real-time Turing machine. It follows therefore that the languages accepted by real-time Turing machines form an infinite hierarchy with respect to the number of tapes used. Although this result was previously obtained elsewhere, our proof is considerably shorter, and explicitly builds the languages Lk. The ability of the real-time Turing machine to model practical real-time and/or parallel computations is open to debate. Nevertheless, our result shows how a complexity theory based on a formal model can draw interesting results that are of more general nature than those derived from examples. Thus, we hope to offer a motivation for looking into realistic parallel real-time models of computation.

scholarly journals ON A GENERALIZATION OF DEHN'S ALGORITHM

2008 ◽  
Vol 18 (07) ◽  
pp. 1137-1177 ◽  
Author(s):  
OLIVER GOODMAN ◽  
MICHAEL SHAPIRO
Keyword(s):  
Finite Groups ◽  
Nilpotent Groups ◽  
Hyperbolic Groups ◽  
Fundamental Groups ◽  
Closure Properties ◽  
Relatively Hyperbolic Groups ◽  
Geometrically Finite ◽  
Geometrically Finite Groups ◽  
Relatively Hyperbolic ◽  
Infinite Subgroup

Viewing Dehn's algorithm as a rewriting system, we generalize to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to include finitely generated nilpotent groups, many relatively hyperbolic groups including geometrically finite groups and fundamental groups of certain geometrically decomposable 3-manifolds. The class has several nice closure properties. We also show that if a group has an infinite subgroup and one of exponential growth, and they commute, then it does not admit such an algorithm. We dub these Cannon's algorithms.

THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS

2006 ◽  
Vol 16 (02) ◽  
pp. 287-305 ◽  
Author(s):  
DAVID EPSTEIN ◽  
DEREK HOLT
Keyword(s):  
Normal Form ◽  
Theoretical Result ◽  
Linear Time ◽  
Hyperbolic Group ◽  
Conjugacy Problem ◽  
Hyperbolic Groups ◽  
Constant Time ◽  
Word Hyperbolic Group ◽  
Group A ◽  
Word Hyperbolic Groups

The main result proved in this paper is that the conjugacy problem in word-hyperbolic groups is solvable in linear time. This is using a standard RAM model of computation, in which basic arithmetical operations on integers are assumed to take place in constant time. The constants involved in the linear time solution are all computable explicitly. We also give a proof of the result of Mike Shapiro that in a word-hyperbolic group a word in the generators can be transformed into short-lex normal form in linear time. This is used in the proof of our main theorem, but is a significant theoretical result of independent interest, which deserves to be in the literature. Previously the best known result was a quadratic estimate.

scholarly journals Fractal Dimension versus Process Complexity

2016 ◽  
Vol 2016 ◽  
pp. 1-21 ◽  
Author(s):  
Joost J. Joosten ◽  
Fernando Soler-Toscano ◽  
Hector Zenil
Keyword(s):  
Fractal Dimension ◽  
Turing Machine ◽  
Time Complexity ◽  
Linear Time ◽  
Space Time ◽  
Polynomial Space ◽  
Turing Machines ◽  
Complexity Measures ◽  
Strong Relation ◽  
Process Complexity

We look at small Turing machines (TMs) that work with just two colors (alphabet symbols) and either two or three states. For any particular such machineτand any particular inputx, we consider what we call thespace-timediagram which is basically the collection of consecutive tape configurations of the computationτ(x). In our setting, it makes sense to define a fractal dimension for a Turing machine as the limiting fractal dimension for the corresponding space-time diagrams. It turns out that there is a very strong relation between the fractal dimension of a Turing machine of the above-specified type and its runtime complexity. In particular, a TM with three states and two colors runs in at most linear time, if and only if its dimension is 2, and its dimension is 1, if and only if it runs in superpolynomial time and it uses polynomial space. If a TM runs in timeO(xn), we have empirically verified that the corresponding dimension is(n+1)/n, a result that we can only partially prove. We find the results presented here remarkable because they relate two completely different complexity measures: the geometrical fractal dimension on one side versus the time complexity of a computation on the other side.

A Real Time Control Architecture for Continuously Managing Patients in a Care Unit

1995 ◽  
Vol 34 (05) ◽  
pp. 475-488
Author(s):  
B. Seroussi ◽  
J. F. Boisvieux ◽  
V. Morice
Keyword(s):  
Real Time ◽  
Linear Time ◽  
Treatment Plan ◽  
Control Architecture ◽  
Real Time Control ◽  
Time Representation ◽  
Time Control ◽  
Continuous Support ◽  
Definition Of ◽  
Computerized System

Abstract:The monitoring and treatment of patients in a care unit is a complex task in which even the most experienced clinicians can make errors. A hemato-oncology department in which patients undergo chemotherapy asked for a computerized system able to provide intelligent and continuous support in this task. One issue in building such a system is the definition of a control architecture able to manage, in real time, a treatment plan containing prescriptions and protocols in which temporal constraints are expressed in various ways, that is, which supervises the treatment, including controlling the timely execution of prescriptions and suggesting modifications to the plan according to the patient’s evolving condition. The system to solve these issues, called SEPIA, has to manage the dynamic, processes involved in patient care. Its role is to generate, in real time, commands for the patient’s care (execution of tests, administration of drugs) from a plan, and to monitor the patient’s state so that it may propose actions updating the plan. The necessity of an explicit time representation is shown. We propose using a linear time structure towards the past, with precise and absolute dates, open towards the future, and with imprecise and relative dates. Temporal relative scales are introduced to facilitate knowledge representation and access.

Design and implementation of decoupled periodic control scheme for a laboratory-based quadruple-tank process

2021 ◽  
pp. 095965182110228
Author(s):  
Jatin K Pradhan ◽  
Arun Ghosh
Keyword(s):  
Real Time ◽  
High Frequency ◽  
Linear Time ◽  
Disturbance Attenuation ◽  
Minimum Phase ◽  
Periodic Control ◽  
Linear Time Invariant ◽  
Control Scheme ◽  
Gain Margin ◽  
Time Invariant

It is well known that linear time-invariant controllers fail to provide desired robustness margins (e.g. gain margin, phase margin) for plants with non-minimum phase zeros. Attempts have been made in literature to alleviate this problem using high-frequency periodic controllers. But because of high frequency in nature, real-time implementation of these controllers is very challenging. In fact, no practical applications of such controllers for multivariable plants have been reported in literature till date. This article considers a laboratory-based, two-input–two-output, quadruple-tank process with a non-minimum phase zero for real-time implementation of the above periodic controller. To design the controller, first, a minimal pre-compensator is used to decouple the plant in open loop. Then the resulting single-input–single-output units are compensated using periodic controllers. It is shown through simulations and real-time experiments that owing to arbitrary loop-zero placement capability of periodic controllers, the above decoupled periodic control scheme provides much improved robustness against multi-channel output gain variations as compared to its linear time-invariant counterpart. It is also shown that in spite of this improved robustness, the nominal performances such as tracking and disturbance attenuation remain almost the same. A comparison with [Formula: see text]-linear time-invariant controllers is also carried out to show superiority of the proposed scheme.

scholarly journals Combable functions, quasimorphisms, and the central limit theorem

2009 ◽  
Vol 30 (5) ◽  
pp. 1343-1369 ◽  
Author(s):  
DANNY CALEGARI ◽  
KOJI FUJIWARA
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Word Length ◽  
Hyperbolic Groups ◽  
Finite State Automaton ◽  
List Type ◽  
Generating Sets ◽  
Finite State ◽  
Word Hyperbolic Groups

AbstractA function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite-state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left- and right-invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include:(1)homomorphisms to ℤ;(2)word length with respect to a finite generating set;(3)most known explicit constructions of quasimorphisms (e.g. the Epstein–Fujiwara counting quasimorphisms).We show that bicombable functions on word-hyperbolic groups satisfy acentral limit theorem: if$\overline {\phi }_n$is the value of ϕ on a random element of word lengthn(in a certain sense), there areEandσfor which there is convergence in the sense of distribution$n^{-1/2}(\overline {\phi }_n - nE) \to N(0,\sigma )$, whereN(0,σ) denotes the normal distribution with standard deviationσ. As a corollary, we show that ifS1andS2are any two finite generating sets forG, there is an algebraic numberλ1,2depending onS1andS2such that almost every word of lengthnin theS1metric has word lengthn⋅λ1,2in theS2metric, with error of size$O(\sqrt {n})$.

Sign in / Sign up

Export Citation Format

Share Document