A Class of Rational Relations Generalising the Subword Order
Matthew McDevitt · Journal of automata, languages and combinatorics · 2018
Using transducers, we introduce a new class of relations on words which generalise the subword order. We show it is decidable whether a given relation in this class is an order. For certain orders in this class we show that the property of being a well-quasi-order is decidable.