Találati lista | Tudóstér

001-es BibID:	BIBFORM012344
Első szerző:	Nagy Benedek (informatikus, matematikus)
Cím:	Graphs of Grammars - Derivations as Parallel Processes / Benedek Nagy
Dátum:	2010
Megjegyzések:	In this paper the concepts of the graph of generative grammars and Lindenmayer systems are investigated. These special and-or graphs represent all information about the grammar. For regular grammars the new concept is equivalent to the finite automata. In context-free case it is an extension of the dependency graph. We also analyze how it is related to programmed grammars (using context-free rules). Moreover the graph of the grammar is more general; it can be defined for generative grammars to any recursive enumerable languages containing all information of the grammar. By the help of tokens the new concept can effectively be used to follow derivations. Moreover parallel derivations can be simulated in non-linear grammars. While in regular and linear case only sequential derivations are going, in context-free case a kind of maximal parallelism can be involved. In context-sensitive case communication/ synchronization is also needed in these processes. The Lindenmayer systems are well-known parallel rewriting systems; our concept also can be defined and used for various Lindenmayer systems. Especially the main difference is not in the graph form, but in the simulation process.
Tárgyszavak:	Természettudományok Matematika- és számítástudományok könyvfejezet formális nyelvek formal languages rewriting systems graphs grammars derivations automata programmed grammars dependency graphs L systems parallel derivations parallel processes Petri nets
Megjelenés:	Computational Intelligence in Engineering / szerk. Imre J. Rudas ; János Fodor ; Janusz Kacprzyk. - p. 1-13.
Internet cím:	Szerző által megadott URL Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon: