Results 1 to 10 of about 1,576 (262)
Information Processing Letters, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olivier Gauwin +2 more
exaly +4 more sources
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings [PDF]
Logical Methods in Computer Science, 2023 This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating automata and prove ...
Gustav Grabolle
doaj +1 more source
A coalgebraic take on regular and $\omega$-regular behaviours [PDF]
Logical Methods in Computer Science, 2021 We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad.
Tomasz Brengos
doaj +1 more source
Visibly Tree Automata with Memory and Constraints [PDF]
Logical Methods in Computer Science, 2008 Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison.
Hubert Comon-Lundh +2 more
doaj +1 more source
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic [PDF]
Logical Methods in Computer Science, 2022 We introduce a model of register automata over infinite trees with extrema constraints. Such an automaton can store elements of a linearly ordered domain in its registers, and can compare those values to the suprema and infima of register values in ...
Szymon Toruńczyk, Thomas Zeume
doaj +1 more source
Reducing Nondeterministic Tree Automata by Adding Transitions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We introduce saturation of nondeterministic tree automata, a technique that consists of adding new transitions to an automaton while preserving its language.
Ricardo Manuel de Oliveira Almeida
doaj +1 more source
Analyzing Timed Systems Using Tree Automata [PDF]
Logical Methods in Computer Science, 2018 Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such
S. Akshay +2 more
doaj +1 more source
Hybrid tree automata and the yield theorem for constituent tree automata
Theoretical Computer Science, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Drewes, Frank +2 more
openaire +2 more sources
Transformations Between Different Types of Unranked Bottom-Up Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string ...
Xiaoxue Piao, Kai Salomaa
doaj +1 more source
Operational State Complexity of Deterministic Unranked Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic tree automata are
Xiaoxue Piao, Kai Salomaa
doaj +1 more source