On the Correspondence between Parallel Communicating Grammar Systems and Restarting Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10105236" target="_blank" >RIV/00216208:11320/11:10105236 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the Correspondence between Parallel Communicating Grammar Systems and Restarting Automata
Original language description
This chapter presents a study of the relationship between Parallel Communicating Grammar Systems (PCGS) and Freely Rewriting Restarting Automata (FRR). The authors introduce and study the so-called distribution complexity and the generation complexity ofPCGS. Results obtained make this class of languages interesting for formal linguistics.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
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)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Book/collection name
Bio-Inspired Models for Natural and Formal Languages
ISBN
978-1-4438-2725-6
Number of pages of the result
35
Pages from-to
153-188
Number of pages of the book
336
Publisher name
Cambridge Scholars Publishing
Place of publication
Newcastle upon Tyne
UT code for WoS chapter
—