About: Regulated Grammars and Automata

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Regulated Grammars and Automata Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.springer.com/computer/theoretical+computer+science/book/978-1-4939-0368-9
Description	This book offers 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 This book offers 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 (en)
Title	Regulated Grammars and Automata Regulated Grammars and Automata (en)
skos:prefLabel	Regulated Grammars and Automata Regulated Grammars and Automata (en)
skos:notation	RIV/00216305:26230/14:PU111923!RIV15-MSM-26230___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(ED1.1.00/02.0070), P(TE01020415), S, Z(MSM0021630528)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Zemek, Petr Meduna, Alexandr
http://linked.open.../riv/druhVysledku	B - Odborná kniha
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	41916
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/14:PU111923
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	formal language theory, grammatical regulation, grammar systems, erasing rules, parallelism, word monoids, regulated and unregulated automata and control languages (en)
http://linked.open.../riv/klicoveSlovo	parallelism grammar systems erasing rules formal language theory grammatical regulation regulated and unregulated automata and control languages word monoids
http://linked.open...ontrolniKodProRIV	[8A516D70CF1F]
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...vEdiceCisloSvazku	NEUVEDEN
http://linked.open...i/riv/nazevZdroje	Regulated Grammars and Automata
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...v/pocetStranKnihy	694 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	IT4Innovations Centre of Excellence V3C - Visual Computing Competence Center
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Meduna, Alexandr Zemek, Petr
http://linked.open...n/vavai/riv/zamer	Výzkum informačních technologií z hlediska bezpečnosti
number of pages	694 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer US
https://schema.org/isbn	978-1-4939-0368-9
http://localhost/t...ganizacniJednotka	26230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software