|
Is there are any implementation or article doc about writing automtaon transducer to work with tree/graphs etc? What I want to implement is some sort of Jape Gate transducer with additional functionality. |
|
Have you looked at OpenFST? It's a Google/NYU developed toolkit for weighted finite state transducers. I don't have a lot of experience with how flexible and (easily) extensible it is, but its open source, so maybe it will serve as a launch pad for you. |
|
You may want to take a look at the CRM114 - "the Controllable Regex Mutilator", particularly regex/approx regex implementations. See: http://crm114.sourceforge.net/wiki/doku.php?id=books |
I'm not familiar with it, but wikipedia has a page on Tree automata that might be useful.
Can you explain what is lacking with the results you will find with a search for "tree transducer" or "tree automata"? E.g. the second hit for a search for "tree transducer" turns up Training Tree Transducers