Results 1 to 10 of about 7,725 (204)
Hyper-Minimization for Deterministic Weighted Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided.
Andreas Maletti, Daniel Quernheim
doaj +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
Improved N-Best Extraction with an Evaluation on Language Data
Computational Linguistics, 2022 We show that a previously proposed algorithm for the N-best trees problem can be made more efficient by changing how it arranges and explores the search space.
Johanna Björklund +2 more
doaj +1 more source
A general approach to solving problems on graphs by collective automata
Труды Института системного программирования РАН, 2018 We propose a general method to solve graph problems by a set of automata (computational agents) located in vertices of undirected ordered connected rooted graph and communicating by passing messages along graph edges.
I. B. Burdonov, A. S. Kossatchev
doaj +1 more source
Isomorphisms of scattered automatic linear orders [PDF]
, 2012 We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable.
Kuske, Dietrich
core +4 more sources
International Journal of Interactive Multimedia and Artificial Intelligence, 2017 The major challenge with fractal image/video coding technique is that, it requires more encoding time. Therefore, how to reduce the encoding time is the research component remains in the fractal coding.
Shailesh Kamble +2 more
doaj +1 more source
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
Comparator automata in quantitative verification [PDF]
, 2018 The notion of comparison between system runs is fundamental in formal verification. This concept is implicitly present in the verification of qualitative systems, and is more pronounced in the verification of quantitative systems.
Bansal, Suguman +2 more
core +3 more sources
Applications of Automata and Graphs: Labeling-Operators in Hilbert Space I [PDF]
, 2008 We show that certain representations of graphs by operators on Hilbert space have uses in signal processing and in symbolic dynamics. Our main result is that graphs built on automata have fractal characteristics.
Fannes M. +11 more
core +2 more sources
Reachability of Consensus and Synchronizing Automata [PDF]
, 2015 We consider the problem of determining the existence of a sequence of matrices driving a discrete-time consensus system to consensus. We transform this problem into one of the existence of a product of the transition (stochastic) matrices that has a ...
Chevalier, Pierre-Yves +2 more
core +1 more source