Results 51 to 60 of about 8,860,193 (293)
Weighted omega-Restricted One Counter Automata [PDF]
Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic system over a ...
Manfred Droste, Werner Kuich
doaj +1 more source
Reduction of context-free grammars
This paper is concerned with the following problem: Given a context-free grammar G, find a context-free grammar with the fewest nonterminal symbols or with the fewest rules that is equivalent to G. A reduction procedure is presented for finding such a reduced context-free grammar that is structurally equivalent to a given G.
Kenichi Taniguchi, Tadao Kasami
openaire +2 more sources
Macros for context-free grammars [PDF]
Current parser generators are based on context-free grammars. Because such grammars lack abstraction facilities, the resulting specifications are often not easy to read. Fischer's macro grammars extend context-free grammars with macro-like productions thus providing the equivalent of procedural abstraction. However, their use is hampered by the lack of
Peter Thiemann 0001, Matthias Neubauer
openaire +1 more source
Syntactic Pattern Recognition for the Prediction of L-Type Pseudoknots in RNA
The observation and analysis of RNA molecules have proved crucial for the understanding of various processes in nature. Scientists have mined knowledge and drawn conclusions using experimental methods for decades.
Christos Koroulis +4 more
doaj +1 more source
Context-free grammar forms with strict interpretations [PDF]
This paper begins a systematic investigation of context-free grammar forms using the mechanism of “strict” interpretations: the interpretations of terminal letters are defined exactly as those of nonterminal letters. Thus, strict interpretations are more
Maurer, H.A., Wood, D., Salomaa, A.
core +1 more source
Inductive Synthesis of Cover-Grammars with the Help of Ant Colony Optimization
A cover-grammar of a finite language is a context-free grammar that accepts all words in the language and possibly other words that are longer than any word in the language.
Wieczorek Wojciech
doaj +1 more source
Lexicalized context-free grammars [PDF]
Lexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that can only generate context-free languages and can be parsed in cubic time.
Yves Schabes, Richard C. Waters
openaire +2 more sources
Context Free Grammar Representation by the Colored Petri Net [PDF]
Specification technique like Colored Petri Net (CPN) allows for the formal description and analysis of the discrete event systems. In this paper, it is presented the methodology for Context Free Grammar design, specification and analysis by the using ...
COJUHARI, Irina, LISNIC, Inga
core +1 more source
A Password Cracking Method Based on Name Initials Shorthand Structure [PDF]
User password guess research is one of the important parts of password security research.According to the relationship between user’s personal information and user password,analyzes the structural characteristics of the user’s personal information ...
LUO Min,ZHANG Yang
doaj +1 more source
Computer-assisted i‘raab of Arabic sentences for teaching grammar to students
The end-case analysis of Arabic sentences is one of the keys to their meaning. This process is called i‘raab, a daunting task for the students. The outcome of the analysis is twofold: (a) placing a proper diacritical marking on the end-cases of ...
Zarah M. Mannaa +2 more
doaj +1 more source

