28 search results - page 2 / 6 » Bisimulation Minimization of Tree Automata |
FSMNLP
2009
Springer
13 years 4 months ago
2009
Springer
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 d...
WIA
2005
Springer
13 years 11 months ago
2005
Springer
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
CBSE
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...
DBPL
2005
Springer
13 years 12 months ago
2005
Springer
ACL
1996
13 years 7 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...