Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Grammars And Other Rewriting Systems (F.4.2) > Parallel Rewriting Systems (F.4.2...)  
  1-10 of 21 Reviews about "Parallel Rewriting Systems (F.4.2...)": Date Reviewed
  Independent parallelism in finite copying parallel rewriting systems
Rambow O., Satta G. Theoretical Computer Science 223(1-2): 87-120, 1999.  Type: Article

The paper is devoted to the study of rewriting systems with a finite degree of synchronized parallelism (d.s.p.), that is, with a bounded number of synchronized subderivations. More precisely, it focuses on the class C ( f )
Nov 1 1999
  Interaction nets and term-rewriting systems
Fernández M., Mackie I. Theoretical Computer Science 190(1): 3-39, 1998.  Type: Article

Interaction net systems, a generalization of Girard’s proof nets introduced by Lafont, are a graphical rewriting formalism with unambiguous and confluent rules, the application of which is a local process that can be parallel...

Apr 1 1999
  On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems
Harrison J. Theoretical Computer Science 164(1-2): 29-40, 1996.  Type: Article

In formal language theory, primitive words and their properties are of fundamental importance. This paper is concerned with deterministic Lindenmayer (D0L) systems and primitivity problems. A D0L system is primitive if every word in th...

Oct 1 1998
  Remarks on regulated limited ET0L systems and regulated context-free grammars
Fernau H., Wätjen D. Theoretical Computer Science 194(1-2): 35-55, 1998.  Type: Article

Many regulation mechanisms for language-generating rewriting systems have been considered in the literature. The paper continues earlier work by the authors, comparing classes of languages obtained by combining these mechanisms. The au...

Aug 1 1998
  A sequential reduction strategy
Antoy S., Middeldorp A. Theoretical Computer Science 165(1): 75-95, 1996.  Type: Article

The authors simplify the proof of Kennaway’s result [1] that every almost orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. First, the authors refine the usual definition of a seq...

Apr 1 1998
  Slender 0L languages
Nishida T., Salomaa A. Theoretical Computer Science 158(1-2): 161-176, 1996.  Type: Article

Two concepts about 0L systems G = ( σ, τ, w ) and their languages L ( G ) = { τ * ( w ) } are the focus of this paper. A language L &...

May 1 1997
  Quasi-deterministic 0L systems and their representation
Nishida T. Theoretical Computer Science 147(1-2): 87-116, 1995.  Type: Article

An L system is a triplet ( &Sgr; , τ , w ), where &Sgr; is some alphabet, w is a string from the alphabet called an axiom, and &tgr; is a set of transformation rules on the alph...

Jun 1 1996
  On generalized DTOL systems and their fixed points
Honkala J. Theoretical Computer Science 127(2): 269-286, 1994.  Type: Article

Let &Sgr; be a set of letters. Formal language theory studies the subsets of the free monoid &Sgr;* (words of &Sgr;). Of particular importance are the DOL systems, that is, the subsets L ( h , w ...

Mar 1 1995
  Parallel and distributed derivations in the single-pushout approach
Ehrig H. (ed), Löwe M. Theoretical Computer Science 109(1-2): 123-143, 1993.  Type: Article

The algebraic approach is one of the most successful approaches to graph rewriting. In this approach, a graph rewriting step is described with a construction involving two pushouts in a suitable category of graphs and total morphisms (...

Sep 1 1994
  Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
Corradini A., Rossi F. (ed) Theoretical Computer Science 109(1-2): 7-48, 1993.  Type: Article

Recently, jungle rewriting has become a popular alternative to term rewriting. Jungles are special acyclic directed hypergraphs, appropriate for representing sets of terms with possibly shared subterms. This important paper shows that ...

Aug 1 1994
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy