Detail publikace

A Formalization of Sequential, Parallel, and Continuous Rewriting

MEDUNA, A.

Originální název

A Formalization of Sequential, Parallel, and Continuous Rewriting

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

A formalization of the sequential, parallel, and continuous rewriting based on a uniform underlying concept of selective substitution grammars is presented. Each of the rewriting modes is formalized through a universal derivation restriction characterizing the rewriting in question. It is shown that whichever of the three rewriting modes is formalized, the resulting grammars generate precisely the family of context sensitive languages. Moreover, when erasing productions are allowed, these grammars generate all recursively enumerable languages.

Klíčová slova

sequential rewriting, parallel rewriting, continuous rewriting, selective substitution grammars, context sensitive languages, recursively enumerable languages

Autoři

MEDUNA, A.

Vydáno

1. 1. 1993

Nakladatel

unknown

Místo

New York

ISSN

0020-7160

Periodikum

International Journal of Computer Mathematics

Ročník

1993

Číslo

47

Stát

Spojené království Velké Británie a Severního Irska

Strany od

153

Strany do

161

Strany počet

9

BibTex

@article{BUT191812,
  author="Alexandr {Meduna}",
  title="A Formalization of Sequential, Parallel, and Continuous Rewriting",
  journal="International Journal of Computer Mathematics",
  year="1993",
  volume="1993",
  number="47",
  pages="153--161",
  issn="0020-7160"
}