Přepisující systémy s omezenými konfiguracemi

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F08%3APU76806" target="_blank" >RIV/00216305:26230/08:PU76806 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Rewriting Systems with Restricted Configurations

Popis výsledku v původním jazyce

This theoretically oriented dissertation discusses rewriting systems, including various automata and grammars.&nbsp; It concentrates its attention upon their combination.&nbsp; More specifically, the central role of the present dissertation plays the general notion of a configuration as an instantaneous description of a rewriting system.&nbsp; Based upon various restrictions placed upon configurations and rewriting modes, the systems are classified and studied. Apart from this major topic, the dissertation also discusses dynamic complexity, which is based upon metrics placed upon the process of yielding strings.<br><br>&nbsp;&nbsp; &nbsp;As its fundamental topic, the dissertation discusses #-rewriting system,&nbsp; reducing deep pushdown automaton, andpushdown automata with restricted pushdowns. In addition, it studies some variants of #-rewriting systems, including <i>n</i>-right linear and generalized #-rewriting system.&nbsp; In general, the dissertation demonstrates how the genera

Název v anglickém jazyce

Rewriting Systems with Restricted Configurations

Popis výsledku anglicky

This theoretically oriented dissertation discusses rewriting systems, including various automata and grammars.&nbsp; It concentrates its attention upon their combination.&nbsp; More specifically, the central role of the present dissertation plays the general notion of a configuration as an instantaneous description of a rewriting system.&nbsp; Based upon various restrictions placed upon configurations and rewriting modes, the systems are classified and studied. Apart from this major topic, the dissertation also discusses dynamic complexity, which is based upon metrics placed upon the process of yielding strings.<br><br>&nbsp;&nbsp; &nbsp;As its fundamental topic, the dissertation discusses #-rewriting system,&nbsp; reducing deep pushdown automaton, andpushdown automata with restricted pushdowns. In addition, it studies some variants of #-rewriting systems, including <i>n</i>-right linear and generalized #-rewriting system.&nbsp; In general, the dissertation demonstrates how the genera

Druh

B - Odborná kniha

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/2C06008" target="_blank" >2C06008: Virtuální laboratoř aplikace mikroprocesorové techniky</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

Kód důvěrnosti údajů

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

ISBN

978-80-214-3722-7

Počet stran knihy

131

Název nakladatele

Faculty of Information Technology BUT

Místo vydání

Brno

Kód UT WoS knihy

—