Translations by Regulated Parallel Communicating Grammar Systems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10130679" target="_blank" >RIV/00216208:11320/11:10130679 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Translations by Regulated Parallel Communicating Grammar Systems

Original language description

Parallel communicating grammar systems (PCGSs) and their regulated variant (RPCGSs) generate languages. We introduce a translation as a binary relation between the words generated simultaneously by two components of such a system. Using sample translations corresponding to the distributive law from algebra we show that RPCGSs can generate a hierarchy of translation classes with respect to the number of strings communicated during corresponding derivations. In the second part we show how to transform anarbitrary RPCGS into an analysis by reduction represented by a new version of freely rewriting restarting automata.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Journal of Automata, Languages and Combinatorics

ISSN

1430-189X

e-ISSN

—

Volume of the periodical

16

Issue of the periodical within the volume

2

Country of publishing house

DE - GERMANY

Number of pages

37

Pages from-to

215-51

UT code for WoS article

—

EID of the result in the Scopus database

—