The computability potential scale of all finite algebras.
Page 1
Displaying 1 – 4 of 4
The lattice of subautomata of an automaton: A survey.
Ćirić, M., Bogdanović, S., Petković, T. (1998)
Publications de l'Institut Mathématique. Nouvelle Série
The theory of core algebras: its completeness.
Freyd, Peter (2007)
Theory and Applications of Categories [electronic only]
Tree transformations defined by hypersubstitutions
Sr. Arworn, Klaus Denecke (2001)
Discussiones Mathematicae - General Algebra and Applications
Tree transducers are systems which transform trees into trees just as automata transform strings into strings. They produce transformations, i.e. sets consisting of pairs of trees where the first components are trees belonging to a first language and the second components belong to a second language. In this paper we consider hypersubstitutions, i.e. mappings which map operation symbols of the first language into terms of the second one and tree transformations defined by such hypersubstitutions....
Currently displaying 1 – 4 of 4
Page 1