Titlebook: Languages Alive; Essays dedicated to Henning Bordihn,Martin Kutrib,Bianca Truthe Book 2012 Springer-Verlag Berlin Heidelberg 2012 algorith

evaculate

Generalized Random Context Picture Grammars: The State of the Art,d the replacement of variables involves the building of functions that will eventually be applied to terminals. Context is used to permit or forbid production rules..Iterated function systems (IFSs) and their generalization, mutually recursive function systems (MRFSs), are among the best-known metho

BLANK

A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems,n . is a full-competence mode in combination with another derivation mode, combined .-mode, for short. Cut-modes were introduced in [.: Cooperating distributed grammar systems as models of distributed problem solving, . 76, 2007] in order to model distributed problem solving by CDGSs, and combined .

Kaleidoscope

Equations in the Partial Semigroup of Words with Overlapping Products, as the latter starts, and in this case the product is obtained by merging these two occurrences of letters, for example . ∙ . = .. Some basic results on equations of words are established by reducing them to corresponding results of ordinary word equations.

态度暖昧

考得

The Boolean Formula Value Problem as Formal Language,sibly pushdown language. We give automata for . which enable us to derive some of its syntactic equations. It is unknown whether the given list of equations is complete. Using these equations some algebraic properties of the syntactic monoid of . are sketched.

myelography

Hairpin Lengthening and Shortening of Regular Languages,n shortening. We study the closure of the class of regular languages under the non-iterated and iterated variants of the two operations. The main results are: although any finite number of applications of the hairpin lengthening to a regular language may lead to non-regular languages, the iterated h

Promotion

有法律效应

,Earley’s Parsing Algorithm and ,-Petri Net Controlled Grammars,arking of a Petri net to Earley’s algorithm, it is shown that languages generated by a subclass of .-Petri net controlled grammars (introduced by J. Dassow and S. Turaev) are parsed in polynomial time of the length of a word.

能够支付

Cultivate