A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
On complements of some bounded context-sensitive languages

1979
*
Information and Control
*

The

doi:10.1016/s0019-9958(79)90272-9
fatcat:hjfcdnsfnrgebegt6adoirxfzq
*language*generated by G is given byL x0 *~a w is a derivation in G (Salomaa, (1973) ). A*language*is*context*-*sensitive*if it is generated by*some**context*-*sensitive*grammar. ... INTRODUCTION I n Istrail (1978) we investigate*some*recursive properties which appear in*context*-*sensitive**languages*. ...##
###
The complement of a finite index matrix language is context sensitive

1980
*
Information and Control
*

In a constructive grammatical way it is proved that the

doi:10.1016/s0019-9958(80)90504-5
fatcat:xnjdep5byfdxldxtsmju57kqri
*complement**of*a -finite index matrix*language*is*context**sensitive*. ... INTRODUCTION*One**of*the famous open problems in formal*language*theory is the question*of*whether the*complement**of*a*context**sensitive**language*is*context**sensitive*or not. ... A family*of**context**sensitive**languages*whose*complements*are*context**sensitive*is given in (Istrail, 1979) too. ...##
###
Page 2885 of Mathematical Reviews Vol. , Issue 84g
[page]

1984
*
Mathematical Reviews
*

Author’s introduction: “

*One**of*the famous open problems in formal*language*theory is the question*of*whether the*complement**of*a*context*-*sensitive**language*is*context*-*sensitive*or not. ... It is known that the*complement**of*a deterministic*context*-*sensitive**language*is*context*-*sensitive*[J. E. Hopcroft and J. D. ...##
###
Classes of languages and linear-bounded automata

1964
*
Information and Control
*

According to C h o m s k y (1959) G is

doi:10.1016/s0019-9958(64)90120-2
fatcat:5fd7qigdfjgo7fbd4blagxqab4
*context*-*sensitive*, if each rule is*of*the t y p e • In general, for a finite set V, we mean by V* the free semigroup generated by V. ... A string x in VT is a sentence*of*G, if x is a t h e o r e m*of*G, t h a t is to say, if S ~ x. T h e set*of*sentences*of*G is the*language*generated b y G, which will be d e n o t e d b y L(G). ...*Languages*that have*context*-*sensitive*, constext-free and*one*-sided linear grammars are*context*-*sensitive*,*context*-free and*one*-sided linear*languages*, respectively. ...##
###
Page 2921 of Mathematical Reviews Vol. 58, Issue 4
[page]

1979
*
Mathematical Reviews
*

Theorem 1: There
exists a number Cy such that the function f defined by f(n) =n" is an upper

*bound**on*the decision complexity*of*an arbitrary property*of**context*-*sensitive**languages*. ... Several sufficient conditions for the existence*of*nontrivial lower*bounds*for the decision complexity*of**context*-*sensitive**languages*are obtained. ...##
###
Page 346 of Mathematical Reviews Vol. , Issue 80A
[page]

1980
*
Mathematical Reviews
*

The class

*of**context*-sensi- tive*languages*is closed under*complementation*if and only if L, is*context*-*sensitive*. ... The*complements**of*the*context*-*sensitive*ianguages form a principal AFL with a hardest set L,. ...##
###
Degree-languages: A new concept of acceptance

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

The class

doi:10.1016/s0022-0000(77)80012-3
fatcat:bwvxnqcrxrhvbb3skz5bmge4mu
*of**context*-*sensitive**languages*is closed under*complementation*if and only if eveG, degree-*language*over a linear*bounded*automaton is either*context*-*sensitive*or is the*complement**of*a*context*-*sensitive*... The class*of*degree-*languages*over pushdown automata (linear*bounded*automata) contains the intersection-closure and the*complements**of*the*context*-free (*context*-*sensitive*)*languages*and it is contained ... THEOREM 6 . 2 . 62 The class*of**context*-*sensitive**languages*is closed under*complementation*if and only if every Iba-degree-*language*is either*context*-*sensitive*or the*complement**of*a*context*-*sensitive*...##
###
Linearly bounded infinite graphs

2006
*
Acta Informatica
*

Linearly

doi:10.1007/s00236-006-0022-z
fatcat:3hialx5b5rao7pduyhjvhtgcda
*bounded*Turing machines have been mainly studied as acceptors for*context*-*sensitive**languages*. ... We present*some**of*their structural properties as well as alternative characterizations in terms*of*rewriting systems and*context*-*sensitive*transductions. ... As the*context*-*sensitive**languages*are closed under*complement*and intersection, L ′ is*context*-*sensitive*. ...##
###
The size of Higman–Haines sets

2007
*
Theoretical Computer Science
*

This nicely contrasts the result

doi:10.1016/j.tcs.2007.07.036
fatcat:pj5zmp5dfvhuvjridivq7l4zia
*on*the effectiveness*of*the Higman-Haines sets for the family*of**context*-free*languages*. ... Finally for the family*of*regular*languages*we prove an upper and a matching lower*bound**on*the size*of*the Higman-Haines sets in terms*of*nondeterministic finite automata. ... subset*of*growing*context*-*sensitive**languages*. ...##
###
Page 2049 of Mathematical Reviews Vol. 51, Issue 6
[page]

1976
*
Mathematical Reviews
*

The author gives a

*bound*for the parsing time for w.c.s.*languages**on*random- access*bounded*activity machine structures and describes in an instructive example*some*typical*context*conditions*of*ALGOL ... . ; The author defines a class*of*so called weakly*context*-*sensitive**languages*(w.c.s.*languages*) that is properly contained in the family*of**context*-*sensitive**languages*and is a proper extension*of*the ...##
###
Page 3749 of Mathematical Reviews Vol. , Issue 81I
[page]

1981
*
Mathematical Reviews
*

With a ‘similar proof it may be shown that normal systems with |a| < |d| (called

*context**sensitive*normal systems) generate the class*of**context**sensitive**languages*. ...*Some**complements*to known results are proved and*some*problems are formulated. M. Novotny (Brno) Paun, Gheorghe 811:68 109*Some*consequences*of*a result*of*Ehrenfeucht and Rozenberg. ...##
###
Page 1312 of Mathematical Reviews Vol. , Issue 2003B
[page]

2003
*
Mathematical Reviews
*

While there are simple relations to the regular and

*context*-*sensitive**ones*, here we shed*some*light*on*the relations to the*context*-free*languages*and*some**of*their important subfamilies.” ... In addition, we show that the set*of**languages*recognized by 4-way NFAs is not closed under*complementation*, and that NFAs are more powerful than DFAs, even for*languages*over*one*symbol.” ...##
###
On the Iterated Hairpin Completion
[chapter]

2010
*
Lecture Notes in Computer Science
*

We will show that it can be non-

doi:10.1007/978-3-642-14455-4_42
fatcat:sg3jdujhkjhwbk6t6zhofebizy
*context*-free. (It is*of*course*context*-*sensitive*.) 2.) A restricted but also very natural variant*of*the hairpin completion is the*bounded*hairpin completion. ... It is known that the iterated hairpin completion*of*a regular*language*is not*context*-free in general, but it was open whether the iterated hairpin completion*of*a singleton or finite*language*is regular ... Acknowledgements I would like to thank Volker Diekert for many suggestions*on*the presentation*of*this paper, Florin Manea for numerous helpful discussions, and the anonymous referees*of*the DLT committee ...##
###
Page 1580 of Mathematical Reviews Vol. , Issue 80D
[page]

1980
*
Mathematical Reviews
*

It is shown that equality sets are al- ways

*context*-*sensitive*but they are*context*-free in the special case where the target alphabet consists*of**one*letter only. ... Such a machine possesses a working tape with a head able to inspect a*bounded*number (k > 3)*of*successive symbols appearing*on*the tape. ...##
###
Further remarks on DNA overlap assembly

2017
*
Information and Computation
*

completeness

doi:10.1016/j.ic.2017.01.009
fatcat:vfo472uabrhv3hq2qhhxh2kp74
*of*a*language*. ... It also investigates the problem*of*deciding whether a given string is terminal with respect to a*language*, and the problem*of*deciding if a given*language*can be generated by an overlap assembly operation ... Acknowledgements We thank the reviewers for their comments which improved the presentation*of*our results. ...
« Previous

*Showing results 1 — 15 out of 68,948 results*