evaculate
发表于 2025-3-26 23:10:31
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
发表于 2025-3-27 01:48:55
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
发表于 2025-3-27 06:57:27
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.
态度暖昧
发表于 2025-3-27 11:44:08
http://reply.papertrans.cn/59/5812/581162/581162_34.png
考得
发表于 2025-3-27 16:12:42
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
发表于 2025-3-27 19:06:10
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
发表于 2025-3-27 22:23:15
http://reply.papertrans.cn/59/5812/581162/581162_37.png
有法律效应
发表于 2025-3-28 03:31:39
,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.
能够支付
发表于 2025-3-28 09:08:45
http://reply.papertrans.cn/59/5812/581162/581162_39.png
Cultivate
发表于 2025-3-28 11:10:05
http://reply.papertrans.cn/59/5812/581162/581162_40.png