WIA
2005
Springer
14 years 5 months ago
2005
Springer
WIA
2005
Springer
14 years 5 months ago
2005
Springer
Weighted finite-state machines with n tapes describe n-ary rational string relations. The join n-ary relation is very important regarding to applications. It is shown how to compu...
WIA
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We use them to model musical styles: a same automaton can be used to...
WIA
2005
Springer
14 years 5 months ago
2005
Springer
WIA
2005
Springer
14 years 5 months ago
2005
Springer
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
WIA
2005
Springer
14 years 5 months ago
2005
Springer
The paper introduces a robust spelling correction technique to deal with ill-formed input strings, including unknown parts of unknown length. In contrast to previous works, we deri...
WIA
2005
Springer
14 years 5 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 ...
TAINN
2005
Springer
14 years 5 months ago
2005
Springer
TAINN
2005
Springer
14 years 5 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
Unit propagation is one of the most important techniques of efficient SAT solvers. Unfortunately, this technique is not directly applicable to first-order clausal tableaux. We sho...