A Backward and a Forward Simulation for Weighted Tree Automata

@inproceedings{Maletti2009ABA,
  title={A Backward and a Forward Simulation for Weighted Tree Automata},
  author={Andreas Maletti},
  booktitle={CAI},
  year={2009}
}
  • A. Maletti
  • Published in CAI 21 August 2009
  • 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. Such reductions are an important tool in automata toolkits. 

Minimizing Weighted Tree Grammars Using Simulation

TLDR
Two types of simulations for W TG over idempotent, commutative semirings are introduced, which generalize the existing notions of simulation and bisimulation for WTG and yield the best reduction rates achievable by all minimization procedures that rely on simulation or bisimulations.

Simulation relations as a means for pattern-matching in treebanks

We consider the problem of nding the occurrences of a pattern tree t in a treebank represented as a directed acyclic graph g, and propose a two-tiered technique, consisting of a preprocessing routine

Social positions and simulation relations

TLDR
It is argued that it is necessary to consider several different equivalence relations for a given network, in order to understand it completely, and definitions of both weighted simulation equivalence and weighted regular equivalence are presented.

Detecting Social Positions Using Simulation

TLDR
This paper primarily considers weighted directed networks and presents definitions of both weighted simulation equivalence and weighted regular equivalence, which can be used to model a number of network domains, including information flow, trust propagation, and communication channels.

References

SHOWING 1-10 OF 22 REFERENCES

Bisimulation Minimization of Tree Automata

TLDR
An algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees is extended to minimize nondeterministic tree automata (NTA) with respect to bisimulation.

Backward and Forward Bisimulation Minimisation of Tree Automata

TLDR
An existing bisimulation minimisation algorithm for tree automata is improved by introducing backward and forward bisimulations and developing minimisation algorithms for them, which are more effective but just as fast than the previous algorithm.

Computing Simulations over Tree Automata

TLDR
It is shown that downward and upward relations can be combined to get relations compatible with the tree language equivalence, which can be used for an efficient size reduction of nondeterministic tree automata.

Multi-Return Macro Tree Transducers

TLDR
An extension of macro tree transducers is introduced with the capability of states to return multiple trees at the same time under call-by-value semantics, and it has better closure properties under composition.

Composed Bisimulation for Tree Automata

TLDR
The experimental results show that the proposed composed bisimulation meets the requirements of an equivalence, and hence provides users of tree automata with a finer way to resolve the trade-off between the available degree of reduction and its cost.

Determinization of Finite State Weighted Tree Automata

TLDR
It is proved sufficient conditions under which the partial determinization produces a bottom-up finite state weighted tree automaton which is equivalent to the original one.

An n log n algorithm for minimizing states in a finite automaton

A Temporal Logic of Nested Calls and Returns

TLDR
This work introduces a temporal logic of calls and returns (CaRet) for specification and algorithmic verification of correctness requirements of structured programs and presents a tableau construction that reduces the model checking problem to the emptiness problem for a Buchi pushdown system.

An Overview of Probabilistic Tree Transducers for Natural Language Processing

TLDR
It is shown that tree acceptors and tree transducers subsume most of the current work on probabilistic modeling for machine translation, summarization, paraphrasing, and language modeling, and it is discussed algorithms for realizing the same benefits found in Probabilistic string transduction.