Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2005

2005

SummaryGeffert has shown that earch recursively enumerable languageL overΣ can be expressed in the formL{h(x)−1g(x)∣x in… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a… Expand

Is this relevant?

1998

1998

An insertion grammar is based on pure rules of the form uv → uxv (the string x is inserted in the context (u, v)). A strict… Expand

Is this relevant?

1995

1995

This paper is an attempt to share with a larger audience some modern developments in the theory of finite automata. It is written… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

The verification of a particular class of infinite-state systems, namely, systems consisting of finite-state processes that… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

Abstract Datalog is a powerful query language for relational databases [10]. We consider the problems of determining containment… Expand

Is this relevant?

Highly Cited

1989

Highly Cited

1989

It is well-known that context-free grammars cannot cover all aspects of natural languages, progamming languages and other related… Expand

Is this relevant?

1985

1985

Abstract We give a homomorphic characterization of the class of recursively enumerable languages: it is shown that any… Expand

Is this relevant?

1981

1981

SummaryRecently, A.C. Shaw introduced a new class of expressions called flow expressions, and conjectured that the formal… Expand

Is this relevant?

1980

1980

Fixed point languages and equality languages of homomorphisms and dgsm mappings are consid- ered. Some basic properties of these… Expand

Is this relevant?