Syntax Notation X (ASN.X) Representation of Encoding Instructions for the Generic String Encoding Rules (GSER) Status of This Memo This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Abstract Abstract Syntax Notation X (ASN.X)...

Most of the observed properties of the string breaking in lattice gauge models in presence of charged dynamical matter can be simply understood in terms of a topological property of the loop expansion in the underlying string description of confinement. Similar considerations apply also to the breaking of the adjoint string. The naive string picture of quark confinement is very simple: in the c...

2-D strings is one of a few representation structures originally designed for use in an IDB environment. In this paper, we propose a generalized approach for 2-D string based indexing which avoids the exhaustive search through the entire database of previous 2-D strings based techniques. The classical framework of representation of 2-D strings is also specialized to the cases of scaled and unsc...

It is shown that metric representation of DNA sequences is one-to-one. By using the metric representation method, suppression of nucleotide strings in the DNA sequences is determined. For a DNA sequence, an optimal string length to display genomic signature in chaos game representation is obtained by eliminating effects of the finite sequence. The optimal string length is further shown as a sel...

Splicing rules of the form (u; v; w; x) are usually represented as strings of the form u#v$w#x. The eeect of splicing with rules from several families of languages has been determined in the literature. We investigate whether the results about splicing systems obtained in this way are indeed properties of the splicing system and not of the speciic string representation of the rules. We study in...

The string theory is a fast moving subject, both physics wise and in the respect of mathematics. In order to keep up with the discipline it is important to move with new ideas which are being stressed. Here I wish to give extracts from new papers of ideas which I have recently found interesting. There are six papers which are involved: I ."Strings formulated directly in 4 dimensions " A. N...

In their recogniser forms, the Earley and RIGLR algorithms for testing whether a string can be derived from a grammar are worst-case cubic on general context free grammars (CFG). Earley gave an outline of a method for turning his recognisers into parsers, but it turns out that this method is incorrect. Tomita’s GLR parser returns a shared packed parse forest (SPPF) representation of all derivat...

In this paper we determine the derived representation type of quadratic string algebras and prove that every tame algebra whose quiver has cycles is equivalent to some skewed-gentle algebra.

String diagrams provide a convenient graphical framework which may be used for equational reasoning about morphisms of monoidal categories. However, unlike term rewriting, which is the standard way of reasoning about the morphisms of monoidal categories, rewriting string diagrams results in shorter equational proofs, because the string diagrammatic representation allows us to formally establish...

During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the application of the string kernel in conjunction with syllables. Using syllables shortens the representation of documents compared to a character based representation and as a result reduces computation time. Moreover sylla...