Abstract: The left and right languages belong to the automata theoretic part of the reduction problem. The left （resp. right） language is the set of calculations leading to（resp, starting from） a state. K-simulations enable a fast detection of these trace inclusion

Key words: State transition systems,K-simulation, Left and right languages