@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00697091v1> a dcat:Dataset ;
    dct:description """
              We propose an extension of visibly pushdown automata by means of weights (represented as positive integers) associated with transitions, called visi- bly pushdown automata with multiplicities. The multiplicity of a computation is the product of the multiplicities of the transitions used along this computation. The multiplicity of an input is the sum of the ones of all its successful compu- tations. Finally, the multiplicity of such an automaton is the supremum of multi- plicities over all possible inputs. We prove the problem of deciding whether the multiplicity of an automaton is finite to be in PTIME. We also consider the K-boundedness problem, i.e. deciding whether the multiplicity is bounded by K: we prove this problem to be EXPTIME- complete when K is part of the input and in PTIME when K is fixed. As visibly pushdown automata are closely related to tree automata, we discuss deeply the relationship of our extension with weighted tree automata.
            """ ;
    dct:identifier "hal-00697091" ;
    dct:issued "2026-05-18T22:40:22.667567"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-18T22:40:22.667573"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00697091v1/resource/0fa5b0d4-b6de-488b-8eeb-f2cf98717346> ;
    dcat:keyword "boundedness",
        "infoeu-reposemanticsreport",
        "infoinfo-flcomputer-science-csformal-languages-and-automata-theory-csfl",
        "multiplicity",
        "reports",
        "visibly-pushdown-automata",
        "weighted-tree-automata" ;
    dcat:landingPage <https://hal.science/hal-00697091> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00697091v1/resource/0fa5b0d4-b6de-488b-8eeb-f2cf98717346> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-18T22:40:22.753986"^^xsd:dateTime ;
    dct:modified "2026-05-18T22:40:22.630968"^^xsd:dateTime ;
    dct:title "Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness" ;
    dcat:accessURL <https://hal.science/hal-00697091> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00697091> a foaf:Document .