Regulated Grammars and Automata

This is the first book to offer key theoretical topics and terminology concerning regulated grammars and automata. They are the most important language-defining devices that work under controls represented by additional mathematical mechanisms. Key topics include formal language theory, grammatical...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Meduna, Alexander (Autor), Zemek, Petr (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer New York : Imprint: Springer, 2014.
Edición:1st ed. 2014.
Temas:
Computer science.
Machine theory.
Computer science-Mathematics.
Discrete mathematics.
Theory of Computation.
Formal Languages and Automata Theory.
Mathematics of Computing.
Discrete Mathematics in Computer Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Introduction
  • Mathematical Background
  • Rudiments of Formal Language Theory
  • Context-Based Grammatical Regulation
  • Rule-Based Grammatical Regulation
  • One-Sided Versions of Random Context Grammars
  • On Erasing Rules and Their Elimination
  • Extension of Languages Resulting from Regulated Grammars
  • Sequential Rewriting over Word Monoids
  • Regulated ET0L Grammars
  • Uniform Regulated Rewriting in Parallel
  • Parallel Rewriting over Word Monoids
  • Regulated Multigenerative Grammar Systems
  • Controlled Pure Grammar Systems
  • Self-Regulating Automata
  • Automata Regulated by Control Languages
  • Jumping Finite Automata
  • Deep Pushdown Automata
  • Applications: Overview
  • Case Studies
  • Concluding Remarks
  • Summary.

Ejemplares similares