Sciweavers

3827 search results - page 168 / 766
» The Epsilon Generation Language
Sort
View
FUIN
2008
71views more  FUIN 2008»
15 years 5 months ago
Nonterminal Complexity of Some Operations on Context-Free Languages
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...
Jürgen Dassow, Ralf Stiebe
ENTCS
2006
133views more  ENTCS 2006»
15 years 5 months ago
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages
The advent of proof-carrying code has generated significant interest in reasoning about low-level languages. It is widely believed that low-level languages with jumps must be diff...
Ando Saabas, Tarmo Uustalu
ICASSP
2011
IEEE
14 years 8 months ago
Subsequence similarity language models
In this work we present the Subsequence Similarity Language Model (S2-LM) which is a new approach to language modeling based on string similarity. As a language model, S2-LM gener...
Juan M. Huerta
EACL
1993
ACL Anthology
15 years 6 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher
FOSSACS
2007
Springer
15 years 11 months ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide