Several comments on pattern recognition system based on the use of attributed grammars
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Page 1
Displaying 1 – 8 of 8
Some combinatorial properties of complete semi-Thue systems.
Kurth, Winfried (1987)
Séminaire Lotharingien de Combinatoire [electronic only]
SOUR graphs for efficient completion.
Lynch, Christopher, Strogova Polina (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Special Issue: AAMP VIII AND ISCAMI 2011
Karel Klouda, Zuzana Masáková, Radko Mesiar, Martin Štěpnička (2012)
Kybernetika
String Assembling Systems
Martin Kutrib, Matthias Wendlandt (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We introduce and investigate string assembling systems which form a computational model that generates strings from copies out of a finite set of assembly units. The underlying mechanism is based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generation is additionally controlled by the requirement that the first symbol of a unit has to be the same as the last symbol of the strand generated so far, as well as by the distinction...
String Assembling Systems
Martin Kutrib, Matthias Wendlandt (2012)
RAIRO - Theoretical Informatics and Applications
We introduce and investigate string assembling systems which form a computational model that generates strings from copies out of a finite set of assembly units. The underlying mechanism is based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generation is additionally controlled by the requirement that the first symbol of a unit has to be the same as the last symbol of the strand generated so far, as well as by the distinction...
Substitution systems associated with the dynamical system (𝒜, Tf)*
Maria de Fátima Correia, Carlos Ramos, Sandra Vinagre (2012)
ESAIM: Proceedings
We consider the dynamical system (𝒜, Tf), where 𝒜 is a class of differential real functions defined on some interval and Tf : 𝒜 → 𝒜 is an operator Tfφ := fοφ, where f is a differentiable m-modal map. If we consider functions in 𝒜 whose critical values are periodic points for f then, we show how to define and characterize a substitution system associated with (𝒜, Tf). For these substitution systems, we compute the growth rate of the...
Syntactic complexity of regulated rewriting
Alexander Meduna, Cynthia J. Crooks, Milan Šárek (1994)
Kybernetika
Currently displaying 1 – 8 of 8
Page 1