String Languages

In James Algebra, there are no instances of counting, ordering or grouping because there is no imposition of Structure other than that of Containment. Importantly, only one axiom permits rearrangement of structure, the forte of string languages. The other two axioms (and most of the theorems) are void-based, they eliminate structure by erasure/deletion, by casting structure into void.

Volume I, p. 138

HSU, Robert W., 1968. Review: A New String-Manipulating Language. Computers and the Humanities. Online. 1968. Vol. 2, no. 5, p. 256–262. Available from: http://www.jstor.org/stable/30199284

FORTE, Allen, 1967. The Programming Language SNOBOL3: An Introduction. Computers and the Humanities. 1967. Vol. 1, no. 5, p. 157–163.

GIAMMARRESI, Dora and RESTIVO, Antonio, 1997. Two-Dimensional Languages. In: ROZENBERG, Grzegorz and SALOMAA, Arto (eds.), Handbook of Formal Languages. Berlin, Heidelberg: Springer Berlin Heidelberg. p. 215–267. [Accessed 10 September 2023]. ISBN 978-3-642-63859-6.

> As a primary requirement, we would like that the class of recognizable picture languages includes in some sense the class of recognizable string languages.