Nondeterministic operations on finite relational structures (Q1276248): Difference between revisions

Based on the introduction to universal algebra for language theory by \textit{B. Courcelle} [Theor. Comput. Sci. 163, 1-54 (1996; Zbl 0874.68170)], this expository article focuses on multivalued operations, which seem to be adequate for the handling of inductive sets of evaluations. In this framework, every transduction definable in counting monadic second-order logic is a bottom-up transduction on term representations.