Results 31 to 40 of about 1,963,594 (263)
Efficient and Modular Coalgebraic Partition Refinement [PDF]
Logical Methods in Computer Science, 2020 We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification.
Thorsten Wißmann +3 more
doaj +1 more source
Rational streams coalgebraically [PDF]
Logical Methods in Computer Science, 2008 We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the equivalence of four notions of representability of rational streams: by finite ...
J. J. M. M. Rutten
doaj +1 more source
Applications in Enumerative Combinatorics of In finite Weighted Automata and Graphs [PDF]
Scientific Annals of Computer Science, 2014 In this paper, we present a general methodology to solve a wide variety of classical lattice path counting problems in a uniform way. These counting problems are related to Dyck paths, Motzkin paths and some generalizations. The methodology uses weighted
R. De Castro, A. Ramírez, J.L. Ramírez
doaj +1 more source
Weighted Regular Tree Grammars with Storage [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids.
Zoltán Fülöp +2 more
doaj +1 more source
Robust Weighted Timed Automata and Games [PDF]
, 2013 Weighted timed automata extend timed automata with cost variables that can be used to model the evolution of various quantities. Although cost-optimal reachability is decidable (in polynomial space) on this model, it becomes undecidable on weighted ...
Markey, Nicolas +5 more
core +1 more source
Quantum Finite Automata and Weighted Automata
J. Autom. Lang. Comb., 2007 10 pages, Preliminary version appears in the Proceedings of ACiD-2005, Texts in Algorithmics series of KCL publications, pp.
M. V. Panduranga Rao, V. Vinay
openaire +4 more sources
On continuous weighted finite automata
Linear Algebra and its Applications, 2012 41 pages, 9 ...
Jarkko Kari 0001 +2 more
openaire +3 more sources
Proper Functors and Fixed Points for Finite Behaviour [PDF]
Logical Methods in Computer Science, 2018 The rational fixed point of a set functor is well-known to capture the behaviour of finite coalgebras. In this paper we consider functors on algebraic categories. For them the rational fixed point may no longer be fully abstract, i.e.
Stefan Milius
doaj +1 more source
Lexically Aware Semi-Supervised Learning for OCR Post-Correction
Transactions of the Association for Computational Linguistics, 2021 Much of the existing linguistic data in many languages of the world is locked away in non- digitized books and documents. Optical character recognition (OCR) can be used to produce digitized text, and previous work has demonstrated the utility of neural ...
Shruti Rijhwani +3 more
doaj +1 more source
, 2011 What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store
Tzevelekos, N, Nikos Tzevelekos
core +1 more source