Filters








1,905 Hits in 4.0 sec

Quasi-Distances and Weighted Finite Automata [chapter]

Timothy Ng, David Rappaport, Kai Salomaa
2017 The Role of Theory in Computer Science  
We show that the neighbourhood of a regular language L with respect to an additive quasi-distance can be recognized by an additive weighted finite automaton (WFA).  ...  with respect to a quasi-distance.  ...  Preliminaries We assume that the reader is familiar with the basics of finite automata and regular languages [9, 19, 20] . A general reference for weighted finite automata is [6] .  ... 
doi:10.1142/9789813148208_0006 dblp:conf/birthday/0001RS17 fatcat:c7owh7tlhbb3ppqlel7penqmoe

Quasi-Distances and Weighted Finite Automata [chapter]

Timothy Ng, David Rappaport, Kai Salomaa
2015 Lecture Notes in Computer Science  
Theorem Suppose that L has an NFA with n states and d is a quasi-distance.  ...  A distance is a function d : An additive weighted finite automaton is a 6-tuple We only need to keep track of the minimal weight computation that reaches each state.  ... 
doi:10.1007/978-3-319-19225-3_18 fatcat:qlsxxzl7tnh6tgwe5y6w6gmqhm

Page 2883 of Mathematical Reviews Vol. , Issue 84g [page]

1984 Mathematical Reviews  
The Moore and quasi-Moore semigroups for the classes of commutative, nilpotent, definite, combinatorial, directable and locally testable automata are characterized.  ...  This definition is made relative to a given class of automata A by saying that S is Moore [quasi-Moore] for A if at least one AGA satisfies $’(A)=S, and, for all AEA, S’(A)=S implies A is a Moore [quasi-Moore  ... 

STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA

KAI SALOMAA, PAUL SCHOFIELD
2007 International Journal of Foundations of Computer Science  
We consider the state complexity of converting additive weighted finite automata to deterministic finite automata.  ...  We introduce an additive weighted finite automaton model that provides a conceptually simple way to reprove this result.  ...  Note that fuzzy finite automata [12] combine weights using a max-min strategy.  ... 
doi:10.1142/s0129054107005443 fatcat:4k2l7abzonhgdg7v56tadez63m

Sublinear DTD Validity [chapter]

Antoine Ndione, Aurélien Lemay, Joachim Niehren
2015 Lecture Notes in Computer Science  
We present an efficient algorithm for testing approximate dtd validity modulo the strong tree edit distance. Our algorithm inspects xml documents in a probabilistic manner.  ...  It detects with high probability the nonvalidity of xml documents with a large fraction of errors, measured in terms of the strong tree edit distance from the dtd.  ...  Weighted Words We present an approximate membership tester for finite automata on weighted words modulo a weighted edit distance. From Trees to Weighted Words.  ... 
doi:10.1007/978-3-319-15579-1_58 fatcat:hhprkhs5ojgdzgesafbunoqpji

Page 9202 of Mathematical Reviews Vol. , Issue 2004k [page]

2004 Mathematical Reviews  
In the general case, we show that general weighted au- tomata algorithms over the appropriate semirings can be used to compute the edit-distance of two weighted automata exactly.  ...  Our algorithm for computing the edit-distance of weighted automata can be used to improve the word accuracy of automatic speech recognition systems.  ... 

Cumulative subject index volumes 40–43

1979 Information and Control  
, 41, 147 Tree decision, complexity: for evaluation of Quasi-40, 258 V Vote-taking algorithm in decoding maximum distance separable codes, 43, 195 W Word code, length: cost depending only  ...  for instruction machines, formal models, 41, 9 Propagating graph 0L systems mathematical investigation, 43, 50 Pushdown store automata realtime, and linear languages, 42, 27 Q Quasi-Optimizer  ... 
doi:10.1016/s0019-9958(79)90069-x fatcat:prorkxke6ncuzeb52kxef5whba

Bisimulation Metrics for Weighted Automata

Borja Balle, Pascale Gourdeau, Prakash Panangaden, Marc Herbstritt
2017 International Colloquium on Automata, Languages and Programming  
weighted automata.  ...  We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation.  ...  Introduction Weighted finite automata (WFA) form a fundamental computational model that subsumes probabilistic automata and various other types of quantitative automata.  ... 
doi:10.4230/lipics.icalp.2017.103 dblp:conf/icalp/BalleGP17 fatcat:uqojvjgcf5aenpfmy5zzhxl7ey

Descriptional Complexity of Error Detection [chapter]

Timothy Ng, David Rappaport, Kai Salomaa
2016 Emergent Computation  
For error detection and error correction applications an important question is to determine the size of the minimal deterministic finite automaton (DFA) needed to recognize the neighbourhood of a language  ...  The neighbourhood of a language L consists of all strings that are within a given distance from a string of L.  ...  The proof (for distances and quasi-distances in [30] and [24] , respectively) uses a construction based on additive weighted finite automata.  ... 
doi:10.1007/978-3-319-46376-6_6 fatcat:nngbjojjzvap3kwo4qa5lnlqg4

Bisimulation Metrics for Weighted Automata [article]

Borja Balle, Pascale Gourdeau, Prakash Panangaden
2017 arXiv   pre-print
weighted automata.  ...  We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation.  ...  Introduction Weighted finite automata (WFA) form a fundamental computational model that subsumes probabilistic automata and various other types of quantitative automata.  ... 
arXiv:1702.08017v2 fatcat:wbbr3tzxbvbkhcnf5d6wyzlswe

Page 938 of Mathematical Reviews Vol. 39, Issue 4 [page]

1970 Mathematical Reviews  
Authors’ summary: “It is shown that in the rth order binary Reed-Muller code of length N = 2" and minimum distance d=2"~', the only codewords having weight between d and 2d are those with weights of the  ...  A. 5215 Restrictions on weight distribution of Reed-Muller codes. ‘Information and Control 14 (1969), 442-456.  ... 

Page 7277 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
Let © =U be a finite alphabet where L and ¥ are disjoint and equipotent sets. Let L be a rational language over £ and let S; be the Simon distance automaton on L.  ...  On the other hand, the decidability of the equivalence problem for deterministic n-tape finite automata was shown in 1991 by Harju and Karhu- For the web version of Mathematical Reviews, see http://www  ... 

Does causal dynamics imply local interactions? [article]

Zoltán Zimborás, Terry Farrelly, Szilárd Farkas, Lluis Masanes
2022 arXiv   pre-print
On the other hand, we show that all one-dimensional quasi-free fermionic QCAs have quasi-local generating Hamiltonians, with interactions decaying exponentially in the massive case and algebraically in  ...  We also prove that some integrable systems do not have local, quasi-local nor low-weight constants of motion; a result that challenges the standard definition of integrability.  ...  This means that after one time-step information only propagates a finite distance.  ... 
arXiv:2006.10707v4 fatcat:dzcgaexv4nggjd2mdbrbxixvnu

Page 3576 of Mathematical Reviews Vol. , Issue 93g [page]

1993 Mathematical Reviews  
Wolfmann, Algebraic curves and vari- eties over finite fields and irreducible cyclic codes (217-225); G. E. Atkin and K.  ...  Mc- Clellan, Block source coding over GF(q) (291-306); Ben Goertzel, On the structural complexity of sequences, images, and automata (307-327); Kyung Hee Kwon, Si-Qing Zheng and Shahram Lat- ifi, Average  ... 

Weighted Timed MSO Logics [chapter]

Karin Quaas
2009 Lecture Notes in Computer Science  
The methods presented in the paper can be adopted to weighted versions of timed automata and Wilke's logic of relative distance.  ...  For this, we investigate subclasses of weighted timed automata and show how we can extend existing timed MSO logics with weights.  ...  Acknowledgement I would like to thank Manfred Droste and Christian Mathissen for their helpful discussions and comments.  ... 
doi:10.1007/978-3-642-02737-6_34 fatcat:beq6akq6ijh2zcgepfopvstapm
« Previous Showing results 1 — 15 out of 1,905 results