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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:46, 5 March 2024

scientific article
Language Label Description Also known as
English
Nondeterministic operations on finite relational structures
scientific article

    Statements

    Nondeterministic operations on finite relational structures (English)
    0 references
    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

    Identifiers