Check out Xerox XFST and its open source clone FOMA for finite state transducers as described by extended regular expresssions, both of which describe the langu

Check out Xerox XFST and its open source clone FOMA for finite state transducers as described by extended regular expresssions, both of which describe the language of regular relations: The Xerox FST book https://press.uchicago.edu/ucp/books/book/distributed/F/bo3613750.html https://press.uchicago.edu/ucp/books/book/distributed/F/bo36... (Xerox XRCE's finite-state-tools comprising the compilers lexc, xfst and twolc, the languages they compile and the formal language finite state transducers describe including linguistic applications) The XFST book https://press.uchicago.edu/ucp/books/book/distributed/F/bo3613750.html https://press.uchicago.edu/ucp/books/book/distributed/F/bo36... FOMA: the open source clone https://fomafst.github.io/ https://fomafst.github.io/ FOMA: the paper (Holden, M. (2009) Proc. EACL) https://aclanthology.org/E09-2008.pdf https://aclanthology.org/E09-2008.pdf FOMA: the open source clone https://fomafst.github.io/ https://fomafst.github.io/ FOMA: the paper (Holden, M. (2009) Proc. EACL) https://aclanthology.org/E09-2008.pdf https://aclanthology.org/E09-2008.pdf