A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
We propose a new high-level programming notation, called FIDO, that we have designed t o c oncisely express regular sets of strings or trees. In particular, it can be viewed as a domain-speci c language for the expression of nite-state automata on large alphabets of sometimes astronomical size. FIDO is based on a combination of mathematical logic and programming language concepts. This combination shares no similarities with usual logic programming languages. FIDO compiles into nitestate stringdoi:10.1109/32.798326 fatcat:mjyi4ksvwrh6feby5hxl37ssfq