4 search results - page 1 / 1 » Compiling Regular Formalisms with Rule Features into Finite-... |
165
click to vote
ACL
1997
15 years 8 months ago
1997
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of ...
158
click to vote
COLING
1996
15 years 8 months ago
1996
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
169
Voted
COLING
1992
15 years 8 months ago
1992
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
207
Voted
EUROCRYPT
2004
Springer
16 years 15 days ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...