Sciweavers

644 search results - page 56 / 129
» Precedence Automata and Languages
Sort
View
136
Voted
SSPR
2000
Springer
15 years 8 months ago
Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
Mikel L. Forcada, Rafael C. Carrasco
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
15 years 10 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
FUIN
2007
86views more  FUIN 2007»
15 years 4 months ago
Relative Nondeterministic Information Logic is EXPTIME-complete
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
Stéphane Demri, Ewa Orlowska
ALT
2010
Springer
15 years 1 months ago
A Spectral Approach for Probabilistic Grammatical Inference on Trees
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
Raphaël Bailly, Amaury Habrard, Franço...
ESOP
2004
Springer
15 years 10 months ago
From Constraints to Finite Automata to Filtering Algorithms
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
Mats Carlsson, Nicolas Beldiceanu