Sciweavers

4231 search results - page 96 / 847
» Using Language More Responsibly
Sort
View
FSTTCS
2008
Springer
15 years 7 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
LATA
2011
Springer
14 years 9 months ago
Classifying Regular Languages via Cascade Products of Automata
Abstract. Building on the celebrated Krohn-Rhodes Theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those c...
Marcus Gelderie
OOPSLA
2000
Springer
15 years 9 months ago
An efficient class and object encoding
An object encoding translates a language with object primitives to one without. Similarly, a class encoding translates classes into other primitives. Both are important theoretica...
Neal Glew
ENTCS
2006
145views more  ENTCS 2006»
15 years 6 months ago
Automated Derivation of Translators From Annotated Grammars
In this paper we propose a technique to automate the process of building translators between operations languages, a family of DSLs used to program satellite operations procedures...
Diego Ordóñez Camacho, Kim Mens, Mar...
ACL
2010
15 years 4 months ago
Identifying Text Polarity Using Random Walks
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
Ahmed Hassan, Dragomir R. Radev