Search Results for "automata"

The goal of this project is to provide a generator for lexical analyzers of maximum computational efficiency and maximum range of applications. This includes the support for Unicode (UTF8, UTF16, ...) and a large variety of other encodings directly and via nested converters such as ICU(tm) and IConv. Sophisticated buffer handling allows to operate on plain file streams, on sockets, or manually fed buffer content. 'Ready-to-build' examples explain related concepts and facilitate practical...

The software resents an executable specification language based on deterministic finite automata, this allows the user to perform tests of word recognition in the state machines that are defined by it. Moreover, it’s possible for the user to assign snippets of code to be executed every transition automaton, these snippets can be described in Lua or PHP programming language. To test that were conducted in the language, was developed a compiler that recognizes words and generates object code.

Proyect aim is to develop a library which allow the management of very large dictionaries very efficiently using, for this purpose, numbered deterministic acyclic finite automata.

Foma is a compiler, programming language, and C library for constructing finite-state automata and transducers for various uses. It has specific support for many natural language processing applications such as producing morphological analyzers.