The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 6557 of Mathematical Reviews Vol. , Issue 2000i
[page]

2000
*
Mathematical Reviews
*

Wilkerson (1-MOR-C; Rolla, MO)
2000i:68094 68Q42 68Q45 Watjen, Dietmar (D-BRNS-TI; Braunschweig) Cooperating distributed

*limited**0L**systems*with external control. ... Markov’s*undecidability**result*(about Markov prop- erties of monoids) remain valid? ...##
###
L Systems
[chapter]

1997
*
Handbook of Formal Languages
*

The earliest

doi:10.1007/978-3-642-59136-5_5
fatcat:5evlmahr75dadkiqepxf7rqkf4
*result*is due to [Da1] , where the*undecidability*of the equation d G 1 (n) = d G 2 (n) for two DT0L*systems*is shown. The*undecidability*holds for*0L**systems*as well. ... the*results**concerning*number*systems*presented below. ...##
###
Theory of L systems: From the point of view of formal language theory
[chapter]

1974
*
Lecture Notes in Computer Science
*

The following

doi:10.1007/3-540-06867-8_1
fatcat:pymonbceyra37o37dymgntem6u
*result*points out "*undecidability*" of various extensions of the class of*0L**systems*. ... (Rozenberg) It is*undecidable*whether an arbitrary iL (COL, EOL, FOL)*system*generates a*0L*language. For L sequences we have for example the following*results*. ...##
###
Supervisory control using variable lookahead policies

1994
*
Discrete event dynamic systems
*

It builds upon the

doi:10.1007/bf01438709
fatcat:mmuknyg2zfdg3lux4vbadlm3hq
*results*presented in Chung, Lin (1992, 1993a)*concerning*this framework. ... This paper deals with the efficient on-line calculation of supervisory controls for discrete event*systems*(DES's) in the framework of*limited*lookahead control policies (or LLPs) that we introduced in ... Fk: a train entering station*k*.*0l*: a train leaving station I.*Some*of these events are made controllable by installing lights at pertinent locations along a track to halt a train from proceeding. ...##
###
The decision problem for equational bases of algebras

1976
*
Annals of Mathematical Logic
*

In section 3 the

doi:10.1016/0003-4843(76)90009-7
fatcat:do2p7jauv5gkjoaysgkj3hryzi
*results*of the previous section are used to establish theorems*concerning*base*undecidable*equational theories. ... All of the*results**concerning*base*undecidability*are proved by a uniform method of translating one theory into another. Although this trans-G.F. ... Let ~, 0 be any non-variable terms in f, g, and v 0. 6 is construed as a*system*of definitions for f, g, h, and*k*in.. Let V be a base for T. ...##
###
Interactive L systems with almost interactionless behaviour

1979
*
Information and Control
*

*Some*interesting properties of e-GD2L

*systems*are established, the main

*result*being the decidability of the sequence equivalence problem for them. I. ... For this reason the most important

*systems*for a biologist are I)

*0L*and DIL sy'stems, the deterministic vcrsions of the basic interactionlcss and interactive

*systems*. ... However, all the

*results*

*concerning*deterministic

*systems*will be proved for the more general case of e-GD2L

*systems*. ...

##
###
Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data
[chapter]

1994
*
Lecture Notes in Computer Science
*

We present a general methodology for designing an ecient algorithm to nd a

doi:10.1007/3-540-57785-8_178
fatcat:nqbeqsqs5fap7ndi6ref4jnocu
*k*-mmg. Under*some*conditions an mmg can be used as an appropriate hypothesis for inductive inference from positive data. ... As*results*several classes of unions of pattern languages are shown to be polynomial time inferable from positive data. ... It is not the case that such a way*results*in a correct identication in the*limit*. ...##
###
TOWER-Complete Problems in Contraction-Free Substructural Logics
[article]

2022
*
arXiv
*
pre-print

The same complexity

arXiv:2201.02496v2
fatcat:ybhpmtuq3fcalegong47rfvilu
*result*holds even for deducibility in BCK-logic, i.e., the implicational fragment of 𝐅𝐋_𝐞𝐰. ... ILZW, ILZW ′ ) by dropping all the inference rules*concerning*connectives not in*K*. ... Introduction The term "substructural logics" [10, 21, 24] is an umbrella term for a family of logics that*limit*the use of*some*(possibly none) of the structural rules. ...##
###
On the Computational Strength of Pure Ambient Calculi

2004
*
Electronical Notes in Theoretical Computer Science
*

., where CM l = CM(i l :

doi:10.1016/j.entcs.2004.04.020
fatcat:utadbmrnozhsvj44vufqlfvsmm
*k**0l*, . . . ,*k*bl ). First we describe the registers. R j (*k*) is encoded as r j [*k*], where the numeral process*k*is defined by 0 df = z[ ]*k*+ 1 df = s[*k*]. ...*limited*concurrency in the increment. ...##
###
On the computational strength of pure ambient calculi

2005
*
Theoretical Computer Science
*

., where CM l = CM(i l :

doi:10.1016/j.tcs.2004.10.007
fatcat:bbpdj2q6pfc7vh3ybjghuaqzzu
*k**0l*, . . . ,*k*bl ). First we describe the registers. R j (*k*) is encoded as r j [*k*], where the numeral process*k*is defined by 0 df = z[ ]*k*+ 1 df = s[*k*]. ...*limited*concurrency in the increment. ...##
###
Time-bounded grammars and their languages

1971
*
Journal of computer and system sciences (Print)
*

Based on

doi:10.1016/s0022-0000(71)80025-9
fatcat:6azj5mtqrrhkthglmyssfb4luq
*results*of Gladkii [7] on connectivity in grammars, it is shown that a "linear speedup" can be obtained and that one can construct Turing acceptors to simulate grammars without loss of time. ... For G ~ (V, 27, R, X), let*k*=max{[*0l*--IpI]p--*0ER}. ... In Section 5, positive closure and containment*results*are studied, while negative closure and*undecidability**results*are given in Section 6. ...##
###
Limited reasoning in first-order knowledge bases with full introspection

1996
*
Artificial Intelligence
*

Then /= Ba E BCYPCNF and

doi:10.1016/0004-3702(95)00063-1
fatcat:4g5ve4wwazh4dkk2qj6skhho2u
*k*OCI E OCYPCNF. Proof. A similar*result*was proven for the logic BLY of [26,27]. Since the proof generalizes in a straightforward way, it is omitted here. 0 Definition 8.5. ... A fundamental problem in knowledge representation is that reasoning, if based on classical logic, is inherently intractable or even*undecidable*. ... Then M = {s 1 skT cd [u] for*some*Sk-terms II }. Proof. Only-if direction: Assume*k*Ba > BP. ...##
###
Decidable subcases of the equivalence problem for recursive program schemes

1987
*
RAIRO - Theoretical Informatics and Applications
*

Définitions and

doi:10.1051/ita/1987210302451
fatcat:4sk7l64blrgd7faz5f7hulpaoq
*results**concerning*DPDA's and strict deterministic grammars (Harrison and Havel [16, 17, 18] ) are recalled in section 1. ... ,t*k*) for*some*ƒ of arity*k*in F and*some*t u . . ., t*k*e T(O, F). ...##
###
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars

1986
*
Theoretical Computer Science
*

systematically investigated and characterized (in

doi:10.1016/0304-3975(86)90050-2
fatcat:kpme4cdkorgohh7556pyx47emy
*some*cases) in terms of*system*transformations by folding, unfolding and rewriting according to the equational algebraic laws. ... Grammars are better characterized in terms of polynomial*systems*which are regular*systems*involving the operation of set union, and the same questions are raised for them. ... The latter problem is*undecidable*, too. • [w] for {w'~M(F)lw~*w'}, w~M(F), • [L] for {[w][ The*undecidability**results**concerning*S <p S' and S up S' follow from Lemma 3.4. ...##
###
An entropic analysis of approximate quantum error correction

2014
*
Physica A: Statistical Mechanics and its Applications
*

In other words, the demon has to erase its record of the measurement

doi:10.1016/j.physa.2014.02.070
fatcat:qicgfo2arvbjnix2ukd2kclejm
*result**k*. ... a minimum number of cases*undecided*(unambiguous QSD, inconclusive classification without errors). ...
« Previous

*Showing results 1 — 15 out of 105 results*