Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/regulated-grammars-and-automata/meduna/descriptif_2915718
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=2915718

Regulated Grammars and Automata, 2014

Langue : Anglais

Auteurs :

Couverture de l’ouvrage 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 regulation, grammar systems, erasing rules, parallelism, word monoids, regulated and unregulated automata and control languages. The book explores how the information utilized in computer science is most often represented by formal languages defined by appropriate formal devices. It provides both algorithms and a variety of real-world applications, allowing readers to understand both theoretical concepts and fundamentals. There is a special focus on applications to scientific fields including biology, linguistics and informatics. This book concludes with case studies and future trends for the field. Regulated Grammars and Automata is designed as a reference for researchers and professionals working in computer science and mathematics who deal with language processors. Advanced-level students in computer science and mathematics will also find this book a valuable resource as a secondary textbook or reference.
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.
Offers key theoretical topics and terminology concerning regulated grammars and automata Includes real-world applications and future trends in the field Covers easy-to-follow theoretical concepts and fundamentals Includes supplementary material: sn.pub/extras

Date de parution :

Ouvrage de 694 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

105,49 €

Ajouter au panier

Date de parution :

Ouvrage de 694 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

105,49 €

Ajouter au panier