# Learning Finite-State Transducers: Evolution Versus Heuristic State Merging

@article{Lucas2007LearningFT, title={Learning Finite-State Transducers: Evolution Versus Heuristic State Merging}, author={Simon M. Lucas and T. Jeff Reynolds}, journal={IEEE Transactions on Evolutionary Computation}, year={2007}, volume={11}, pages={308-325} }

Finite-state transducers (FSTs) are finite-state machines (FSMs) that map strings in a source domain into strings in a target domain. While there are many reports in the literature of evolving FSMs, there has been much less work on evolving FSTs. In particular, the fitness functions required for evolving FSTs are generally different from those used for FSMs. In this paper, three string distance-based fitness functions are evaluated, in order of increasing computational complexity: string… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 17 CITATIONS

## Computational Intelligence for Deepwater Reservoir Depositional Environments Interpretation

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## A Hand-Held Multimedia Translation and Interpretation System with Application to Diet Management

VIEW 1 EXCERPT

CITES METHODS

## Artificial Intelligence and Games

VIEW 1 EXCERPT

CITES BACKGROUND

## Extending XCS with Cyclic Graphs for Scalability on Complex Boolean Problems

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

## Review on Grouping Algorithms for Finite State Automata

VIEW 1 EXCERPT

CITES BACKGROUND

## Sumathi Review on Grouping Algorithms for Finite State Automata

VIEW 1 EXCERPT

CITES BACKGROUND

## Inferring Automata Logic from Manual Control Scenarios: Implementation in Function Blocks

VIEW 1 EXCERPT

CITES BACKGROUND

## An approach to the inference of finite state machines based on a gravitationally-inspired search algorithm

VIEW 2 EXCERPTS

CITES RESULTS & METHODS

## Extending learning classifier system with cyclic graphs for scalability on complex, large-scale boolean problems

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 44 REFERENCES

## Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Statistical syntactic methods for high-performance OCR

VIEW 6 EXCERPTS

## Structuring chromosomes for context-free grammar evolution

VIEW 6 EXCERPTS

## Evidence Driven State Merging with Search

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: the GIG Method

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## When will a Genetic Algorithm Outperform Hill Climbing

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Symmetry breaking in population-based optimization

VIEW 1 EXCERPT

## Evolution of strategies for resource protection problems

VIEW 2 EXCERPTS