3440 search results - page 16 / 688 » Logics For Context-Free Languages |
ICSM
2005
IEEE
15 years 3 months ago
2005
IEEE
In the work presented here, we introduce a method to automatically generate a subset of a UML class model based on a user-defined criterion. The goal of this work is to allow us to...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the searc...
ACL
1998
14 years 11 months ago
1998
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (...
BMCBI
2005
14 years 9 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
FCT
2005
Springer
15 years 3 months ago
2005
Springer
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...