Results 1 to 10 of about 12,979 (182)
Finite Sequentiality of Unambiguous Max-Plus Tree Automata [PDF]
Theory of Computing Systems, 2021 AbstractWe show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata. A max-plus tree automaton is called unambiguous if there is at most one accepting run on every tree. The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree ...
Erik Paul
openaire +6 more sources
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata [PDF]
Theory of Computing Systems, 2021 AbstractWe show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if the number of accepting runs on every tree is bounded by a global constant.
Erik Paul
openaire +6 more sources
Containment and equivalence of weighted automata: Probabilistic and max-plus cases [PDF]
Lecture Notes in Computer Science, 2020 This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps ...
A Bertoni +26 more
core +4 more sources
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata [PDF]
, 2020 We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring.
Paul, Erik
core +1 more source
The Strahler number of a parity game [PDF]
, 2020 The Strahler number of a rooted tree is the largest height of a perfect binary tree that is its minor. The Strahler number of a parity game is proposed to be defined as the smallest Strahler number of the tree of any of its attractor decompositions.
Daviaud, L. +2 more
core +5 more sources
Finite Sequentiality of Unambiguous Max-Plus Tree Automata [PDF]
, 2019 We show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata. A max-plus tree automaton is called unambiguous if there is at most one accepting run on every tree.
Paul, Erik
core +1 more source
First-Order and Temporal Logics for Nested Words [PDF]
, 2007 Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured data, such as XML.
Erich Grädel +6 more
core +13 more sources
Weighted Logics for Nested Words and Algebraic Formal Power Series [PDF]
, 2010 Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study nested word series which assign to nested words elements of a semiring. We show
Mathissen, Christian
core +1 more source
Deterministic Automata for Unordered Trees [PDF]
, 2014 Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which ...
Boiret, Adrien +3 more
core +7 more sources
Digraph Complexity Measures and Applications in Formal Language Theory [PDF]
, 2011 We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages.
Hermann Gruber +1 more
core +4 more sources