Filters








3,341 Hits in 4.3 sec

Rigorous approximated determinization of weighted automata

Benjamin Aminof, Orna Kupferman, Robby Lampert
2013 Theoretical Computer Science  
Applications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing.  ...  Unfortunately, many natural WFAs cannot be determinized. In this paper we study approximated determinization of WFAs.  ...  The sequence of work above suggests that determinization of weighted automata is of great theoretical and practical interest, and that the lack of a rigorous approximated determinization construction should  ... 
doi:10.1016/j.tcs.2013.02.005 fatcat:3no3eoyglnah3fon5yi3ccewzq

Rigorous Approximated Determinization of Weighted Automata

Benjamin Aminof, Orna Kupferman, Robby Lampert
2011 2011 IEEE 26th Annual Symposium on Logic in Computer Science  
Applications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing.  ...  Unfortunately, many natural WFAs cannot be determinized. In this paper we study approximated determinization of WFAs.  ...  The sequence of work above suggests that determinization of weighted automata is of great theoretical and practical interest, and that the lack of a rigorous approximated determinization construction should  ... 
doi:10.1109/lics.2011.50 dblp:conf/lics/AminofKL11 fatcat:z47qyvyc7faepkhrqxqsjpvaqa

Approximate Determinization of Quantitative Automata

Udi Boker, Thomas A. Henzinger, Marc Herbstritt
2012 Foundations of Software Technology and Theoretical Computer Science  
This gets an evident in approximate determinization, as they cannot be determinized approximately even if their weights are restricted to any pair of distinct values.  ...  Discounted-sum automata allow for approximate determinization, as the influence of a word's suffix is decaying.  ...  We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.  ... 
doi:10.4230/lipics.fsttcs.2012.362 dblp:conf/fsttcs/BokerH12 fatcat:me6xtk6nnbfcfmwnnbticxzjoa

Page 3588 of Mathematical Reviews Vol. , Issue 90F [page]

1990 Mathematical Reviews  
Moreover, from the central result analogous results are derived for some classes of automata for which the decidability of the state equivalence problem has not yet been considered, such as weighted automata  ...  This provides some basis for at least approximate reasoning with uninterpretable propositions. The authors use an extended notion of D.  ... 

Page 1310 of Mathematical Reviews Vol. , Issue 2002B [page]

2002 Mathematical Reviews  
Both finite ac- tion set automata and continuous action set automata models are considered. All algorithms presented have rigorous convergence proofs.  ...  In ordinary prac- tice, the learning duration is determined by the capabilities of the learner and the professional instructor.  ... 

Page 6701 of Mathematical Reviews Vol. , Issue 94k [page]

1994 Mathematical Reviews  
Summary: “We introduce weighted finite automata (WFA) as a tool to define real functions, in particular, the greyness functions of grey-tone images.  ...  6701 70 94k:68198 68U10 Culik, Karel, II (1-SC-C; Columbia, SC); Kari, Jarkko (SF-TURK; Turku) Image compression using weighted finite automata.  ... 

Automata-based Quantitative Verification [article]

Suguman Bansal
2020 arXiv   pre-print
The introduced framework, called comparator automata or comparators in short, builds on automata-theoretic foundations to generalize across a variety of cost models.  ...  Most algorithms comprise of a structural phase which reasons about the structure of the quantitative system(s) using techniques from automata or graphs, and a numerical phase, which reasons about the quantitative  ...  The problem of quantitative inclusion between two weighted ω-automata determines whether the weight of all words in one automaton is less that (or equal to) that in the other automaton.  ... 
arXiv:2010.02055v1 fatcat:jynqpn2msrdi5j72t3fm6yuiti

Model measuring for hybrid systems

Thomas A. Henzinger, Jan Otop
2014 Proceedings of the 17th international conference on Hybrid systems: computation and control - HSCC '14  
We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values  ...  of parameters.  ...  Acknowledgment This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling).  ... 
doi:10.1145/2562059.2562130 dblp:conf/hybrid/HenzingerO14 fatcat:wpq67ynf3rbcfhvburimxeaccq

On Computability, Learnability and Extractability of Finite State Machines from Recurrent Neural Networks [article]

Reda Marzouk
2020 arXiv   pre-print
As for learnability, an extension of the active learning framework better suited to the problem of approximating RNNs with FSMs is proposed, with the aim of better formalizing the problem of RNN approximation  ...  With regard to computability, new computational results on the distance and the equivalence problem between RNNs trained as language models and different types of weighted finite state machines were given  ...  The state space of a pushdown automaton is the cartesian product of a finite state space with the set of all strings that represents its stack content Weighted automata are more rigorously defined  ... 
arXiv:2009.06398v1 fatcat:qow5uzwcezd7vafuobfocs4dye

Page 562 of Mathematical Reviews Vol. , Issue 2003A [page]

2003 Mathematical Reviews  
(316-339); Martin Franzle, What will be eventually true of polynomial hybrid automata?  ...  , Peter Sewell and Keith Wansbrough, The UDP calculus: rigorous semantics for real net- working (535-559); Benjamin C.  ... 

Computing the Weights of Polynomial Cellular Neural Networks Using Quadratic Programming [chapter]

Anna Rubi-Velez, Eduardo Gomez-Ramirez, Giovanni E. Pazienza
2009 Lecture Notes in Computer Science  
Finding the weights of a Polynomial Cellular Neural/Nonlinear Network performing a given task is not straightforward.  ...  Here, we prove that quadratic programming can solve this problem efficiently and effectively in the particular case of a totalistic network.  ...  Considering the previous work [6] , it is possible to find through a rigorous method the parameters -degree of the polynomial and the weights of the network -of a one-layer space-invariant Polynomial  ... 
doi:10.1007/978-3-642-10268-4_76 fatcat:ozxzs5pl2faytntluvejx4fyv4

Page 637 of Mathematical Reviews Vol. 55, Issue 2 [page]

1978 Mathematical Reviews  
whose coefficients are determined by a distance-weighted least squares fit of the f-values using the ith point and six or more of its nearest neighbors.  ...  The author also comments on other knot place- ment algorithms, and on the problems of rigorously analyzing the effectiveness of any of these algorithms.  ... 

Positive feedbacks promote power-law clustering of Kalahari vegetation

Todd M. Scanlon, Kelly K. Caylor, Simon A. Levin, Ignacio Rodriguez-Iturbe
2007 Nature  
Fractional tree cover, f t , mean canopy area, c c, and the dominant species are derived from 0.25-1.0 ha stem map surveys of the sites 12,13 .  ...  Acknowledgements Funding for this research was provided by grants to Princeton University from the NSF, the Mellon Foundation and the NSF National Center for Earth Surface Dynamics, and a grant to the University of  ...  from approximately 1,200 to 200 mm per year.  ... 
doi:10.1038/nature06060 pmid:17851523 fatcat:62a5ftl45zadhpsyf6wryipc2u

Selected Papers of the First International Conference on Algorithms for Computational Biology (AlCoB 2014)

Adrian-Horia Dediu, Carlos Martin-Vide
2018 IEEE/ACM Transactions on Computational Biology & Bioinformatics  
Out of 39 submissions to the conference, only four papers representing the current state-of-the-art in their respective domains were accepted to this special section.  ...  This special section of the IEEE/ACM Transactions on Computational Biology and Bioinformatics contains extended versions of the best papers presented at the First International Conference on Algorithms  ...  After several revisions, four papers were accepted (yielding an acceptance rate of approximately 10% of the submissions to the conference).  ... 
doi:10.1109/tcbb.2018.2804398 fatcat:7pexl6czizgyvkjmd4c2oz4mw4

Causal Emergence in Discrete and Continuous Dynamical Systems [article]

Thomas F. Varley
2020 arXiv   pre-print
Despite it's apparent universality and the considerable interest, historically researchers have struggled to provide a rigorous, formal definition of emergence that is applicable across fields.  ...  We find that emergence, as well as its component elements (determinism, degeneracy, and effectiveness) vary dramatically in different dynamical regimes in sometimes unexpected ways.  ...  Alice Patania for their thoughtful insights and discussions over the course of these projects.  ... 
arXiv:2003.13075v1 fatcat:jrnuc3zpcvgttlizbcq7sddbzm
« Previous Showing results 1 — 15 out of 3,341 results