Filters








7,859 Hits in 5.4 sec

Simulations of Weighted Tree Automata [chapter]

Zoltán Ésik, Andreas Maletti
2011 Lecture Notes in Computer Science  
Simulations of weighted tree automata (wta) are considered.  ...  In addition, it is shown in several cases (fields, commutative rings, Noetherian semirings, semiring of natural numbers) that all equivalent wta M and N can be joined by a finite chain of simulations.  ...  Simulations of Weighted Tree Automata Z. Ésik and A.  ... 
doi:10.1007/978-3-642-18098-9_34 fatcat:osvl4mg3krhu5khaqpvdzgzyk4

THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA

ZOLTÁN ÉSIK, ANDREAS MALETTI
2011 International Journal of Foundations of Computer Science  
Simulations of weighted tree automata (wta) are considered.  ...  In addition, it is shown in several cases (fields, commutative rings, Noetherian semirings, semiring of natural numbers) that all equivalent wta M and N can be joined by a finite chain of simulations.  ...  Thus, journal The Category of Simulations for Weighted Tree Automata 11 A allows the definition of the star operation a * = n∈N a n for every a ∈ A.  ... 
doi:10.1142/s0129054111009070 fatcat:p4veo2bjifghvbwedcc2u3b22y

Quantitative simulations by matrices

Natsuki Urabe, Ichiro Hasuo
2017 Information and Computation  
We introduce notions of simulation between semiring-weighted automata as models of quantitative systems.  ...  Furthermore, an extension to weighted tree automata is presented and implemented.  ...  Andrzej Murawski, Shota Nakagawa and the anonymous referees (for the conference version and the current extended version) for useful discussions and comments; and to Björn Wachter for the user support of  ... 
doi:10.1016/j.ic.2016.03.007 fatcat:mrulo2pw7ve7haflnszt2eansa

A learning automata-based algorithm using stochastic minimum spanning tree for improving life time in wireless sensor networks
English

Asgari Chamran, Rahmati Torkashv Rohollah, Barati Masoud
2013 International Journal of Physical Sciences  
Although this assumption that edges weights change with time makes our task difficult, the results of simulations indicate relatively optimal performance of this method.  ...  In this paper, we presented a heuristic algorithm based on distributed learning automata with variable actions set for solving data aggregation problems within stochastic graphs where the weights of edges  ...  The weight assigned to the chosen edge is added to total weight of spanning tree. To avoid forming a loop in a tree, each of active learning automata trims its own actions set.  ... 
doi:10.5897/ijps12.325 fatcat:o5nhfdob4ba7pe274nzxkjkmge

A Backward and a Forward Simulation for Weighted Tree Automata [chapter]

Andreas Maletti
2009 Lecture Notes in Computer Science  
Two types of simulations for weighted tree automata (wta) are considered. Wta process trees and assign a weight to each of them. The weights are taken from a semiring.  ...  The two types of simulations work for wta over additively idempotent, commutative semirings and can be used to reduce the size of wta while preserving their semantics.  ...  Their comments improved the presentation of the paper.  ... 
doi:10.1007/978-3-642-03564-7_19 fatcat:dwvo7o7565ek7fgtyy4lwb2kba

Page 3961 of Mathematical Reviews Vol. , Issue 91G [page]

1991 Mathematical Reviews  
For this purpose the author introduces finite tree automata with weights in a semiring and is able to establish a generaliza- tion of Eilenberg’s equality theorem to finite tree automata.  ...  The author studies the complexity of the equivalence problem for finite tree automata.  ... 

Page 9249 of Mathematical Reviews Vol. , Issue 2001M [page]

2001 Mathematical Reviews  
to the Dyck language of first order D{* can be recognized by weighted automata over the real tropical semiring.  ...  simulant, under a certain condition on its simulant entropies.”  ... 

A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs

Javad Akbari Torkestani, Mohammad Reza Meybodi
2010 Journal of Supercomputing  
In this paper, we propose a learning automata-based heuristic algorithm to solve the minimum spanning tree problem in stochastic graphs wherein the probability distribution function of the edge weight  ...  During the last decades, a host of efficient algorithms have been developed for solving the minimum spanning tree problem in deterministic graphs, where the weight associated with the graph edges is assumed  ...  A minimum spanning tree of a weighted, undirected graph G is a spanning tree of G whose edges sum to minimum weight.  ... 
doi:10.1007/s11227-010-0484-1 fatcat:lpg2w3664rctrjcmj4pk37p7sm

Page 5323 of Mathematical Reviews Vol. , Issue 82m [page]

1982 Mathematical Reviews  
optimal multiway search trees (t>2), and optimal leaf search trees (or alphabetic code trees) with leaf weights only.  ...  Authors’ summary: “Given N weighted keys, N+1 missing-key weights and a branching factor ¢, the application of dynamic programming yields algorithms for constructing optimal binary search trees (t= 2),  ... 

Soliton automata

J. Dassow, H. Jürgensen
1990 Journal of computer and system sciences (Print)  
We prove a characterization of strongly deterministic soliton automata, certain important properties of their transition monoids, and a characterization of the class of automata which can be simulated  ...  Finally the cost of this simulation is discussed. 'i'l  ...  This shows that exactly the group automata can be simulated by soliton automata-though possibly at a tremendous cost.  ... 
doi:10.1016/0022-0000(90)90010-i fatcat:2zvcj66n3jck3ixlboh6ehl5cy

Page 1636 of Mathematical Reviews Vol. 42, Issue 6 [page]

1971 Mathematical Reviews  
Probabilistic versions of climbing (tree) automata and sinking (tree) automata are defined, respectively. The concept of isolated cut point for probabilistic tree automata is also defined.  ...  The existence of a solution is shown on the basis of two statistical assumptions, which are considered reasonable on the basis of a set of simulations of a collection ofautomata. J. D.  ... 

COMPOSED BISIMULATION FOR TREE AUTOMATA

PAROSH AZIZ ABDULLA, AHMED BOUAJJANI, LUKÁŠ HOLÍK, LISA KAATI, TOMÁŠ VOJNAR
2009 International Journal of Foundations of Computer Science  
We address the problem of reducing the size of (nondeterministic, bottom-up) tree automata using suitable, language-preserving equivalences on the states of the automata.  ...  The experimental results we present in the paper show that our composed bisimulation meets such requirements, and hence provides users of tree automata with a finer way to resolve the trade-off between  ...  Finally, it can be interesting to extend the algorithms presented in this paper to work for other kinds of tree automata such as guided tree automata, weighted tree automata, or unranked tree automata.  ... 
doi:10.1142/s0129054109006814 fatcat:qf6hgbc2h5hq5l6agd6jzy4ezq

Cumulative subject index volumes 64–67

1985 Information and Control  
automata, 67, 126 Space cellular, one-dimensional, real-time simulation, 67, 163 probabilistic, polynomial deterministic space simulation, lack of two-way random-tape algorithm for, 67, 158  ...  : restricted classes of pushdown automata, 67, 126 U Unraveling k-page graphs, 66, 1 Printed in Belgium  ... 
doi:10.1016/s0019-9958(85)80038-3 fatcat:cnfpoerj4bgahkwbjf5nrkty5e

Minimizing Weighted Tree Grammars Using Simulation [chapter]

Andreas Maletti
2010 Lecture Notes in Computer Science  
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings.  ...  They can be used in natural language parsing to directly generate the parse tree of a sentence or to encode the set of all parse trees of a sentence.  ...  Conclusion We introduced the most general simulation relations for weighted tree automata, which generalize all the existing notions of [21, 17, 26] .  ... 
doi:10.1007/978-3-642-14684-8_7 fatcat:wan7ocoan5a3ljl7mu6u7fkddm

Page 2841 of Mathematical Reviews Vol. , Issue 89E [page]

1989 Mathematical Reviews  
Based on observations of computer runs of some simulated totalis- tic cellular automata (CAs), S.  ...  In particular, a parametric version of the minimum weight vertex cover problem on trees is considered.  ... 
« Previous Showing results 1 — 15 out of 7,859 results