Nondeterministic operations on finite relational structures (Q1276248)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1243212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondeterministic operations on finite relational structures |
scientific article; zbMATH DE number 1243212 |
Statements
Nondeterministic operations on finite relational structures (English)
0 references
20 January 1999
0 references
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.
0 references
formal language
0 references
context-free set
0 references
transducer
0 references
hypergraph
0 references
multivalued operations
0 references
monadic second-order logic
0 references
0 references
0.7285610437393188
0 references
0.7214937210083008
0 references
0.7195520997047424
0 references
