Results 1 to 10 of about 8,860,193 (293)
QoS-aware service composition based on context-free grammar and skyline in service function chaining using genetic algorithm. [PDF]
PeerJ Comput Sci, 2021 Khosravian P +3 more
europepmc +1 more source
MERENCANAKAN PROGRAM PENGAJARAN DENGAN PENDEKATAN FUNCTIONAL GRAMMAR (TOPIK: FOOD)
Khazanah Pendidikan, 2011 This article explain about Planning the Instructional Program for the teachers of elementary School, especially English teacher. The purpose of this program is for giving procedure genre matter with topic on food.
Tuti Purwati
doaj +1 more source
Using Earley Parser for Verification of Totally Ordered Hierarchical Plans
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceHierarchical planning extends classical planning by capturing the hierarchical structure of tasks via decomposition of tasks to subtasks. Hierarchical plan verification is the problem of determining whether a given plan is valid according to that ...
Kristýna Pantůčková +2 more
doaj +1 more source
Studies in English Language and Education, 2014 Writing is a means of communication to convey meaning as well as a medium for self-expression and self assessment and also for teacher-assessment.
Rahmi Fhonna
doaj +1 more source
An approach for design pattern detection based on the formal context-free grammar relation driver
工程科学学报, 2016 Aiming at the false negative problem and the overlap problem in pattern instance detection,in order to improve the accuracy of the design pattern recovery,this article introduces an approach for design pattern detection based on the formal context-free ...
XIAO Zhuo-yu +4 more
doaj +1 more source
Structural equivalence of context-free grammars
8th Annual Symposium on Switching and Automata Theory (SWAT 1967), 1967 AbstractTwo context-free grammars are defined as being structurally-equivalent if they generate the same sentences and assign similar parse trees (differing only in the labelling of the nodes) to each. It is argued that this type of equivalence is more significant than weak equivalence, which requires only that the same sentences be generated.
Marvin C. Paull, Stephen H. Unger
openaire +4 more sources
О существовании порождающей КС-грамматики для произвольной линейной диофантовой системы [PDF]
Проблемы анализа, 1999 В работе доказывается существование контекстно-свободной грамматики и терминальной цепочки, порождающих произвольно заданную систему линейных диофантовых уравнений (ЛДУ).In this paper we prove the existance of a context-free grammar and a terminal string,
Корзун Д. Ж.
doaj
The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing
Algorithms, 2011 The smallest grammar problem—namely, finding a smallest context-free grammar that generates exactly one sequence—is of practical and theoretical importance in fields such as Kolmogorov complexity, data compression and pattern discovery.
Gabriel Infante-Lopez +3 more
doaj +1 more source
On Quantum Context-Free Grammars
CoRRQuantum computing is a relatively new field of computing, which utilises the fundamental concepts of quantum mechanics to process data. The seminal paper of Moore et al. [2000] introduced quantum grammars wherein a set of amplitudes was attached to each production. However they did not study the final probability of the derived word. Aruja et al. [2025]
Merina Aruja +2 more
openaire +2 more sources
Hidden Abstract Stack Markov Models with Learning Process
MathematicsWe present hidden abstract stack Markov models (HASMMs) with their learning process. The HASMMs we offer carry the more expressive nature of probabilistic context-free grammars (PCFGs) while allowing faster parameter fitting of hidden Markov models (HMMs)
Mete Özbaltan
doaj +1 more source