1-Normal Form for Static Watson-Crick Regular and Linear Grammars
ASM Science Journal, 2020 In DNA computing, there are various formal language theoretical approaches that involves the recombinant behavior of DNA sequences. A Watson-Crick automaton is a mathematical model that represents the biological properties of DNA based on the Watson ...
Aqilahfarhana Abdul Rahman1 +3 more
semanticscholar +2 more sources
Computational Complexity of Algorithms for Optimization of Multi-Hybrid Renewable Energy Systems
IEEE International Conference on Power System Technology, 2018 A well designed algorithm helps to determine the optimum size of power generation system. And for Multi-Hybrid Renewable Energy Systems (MHRESs), comprising of two alternative energy systems working together, such as PV array, Wind turbine, and Hydro ...
Famous O. Igbinovia, J. Krupka
semanticscholar +2 more sources
Simulating finite automata with context-free grammars
Information Processing Letters, 2002 We consider simulating finite automata (both deterministic and nondeterministic) with context-free grammars in Chomsky normal form (CNF). We show that any unary DFA with n states can be simulated by a CNF grammar with O(n^{1/3}) variables, and this bound
M. Domaratzki, G. Pighizzini, J. Shallit
semanticscholar +2 more sources
Greibach Normal Form for ω-Algebraic Systems and Weighted Simple ω-Pushdown Automata [PDF]
Information and Computation, 2020 In weighted automata theory, many classical results on formal languages have been extended into a quantitative setting. Here, we investigate weighted context-free languages of infinite words, a generalization of $\omega$-context-free languages (Cohen ...
M. Droste, S. Dziadek, W. Kuich
semanticscholar +1 more source
A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form
Entropy, 2021 The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot.
Zaijun Zhang, Daoyun Xu, Jincheng Zhou
semanticscholar +1 more source
Using WFSTs for Efficient EM Learning of Probabilistic CFGs and Their Extensions
Information and Media Technologies, 2014 Probabilistic context-free grammars (PCFGs) are a widely known class of probabilistic language models. The Inside-Outside (I-O) algorithm is well known as an efficient EM algorithm tailored for PCFGs.
Yoshitaka Kameya +2 more
semanticscholar +1 more source
Gentree of Tool for Syntactic Analysis Based On Younger Cocke Kasami Algorithm
, 2017 Syntactic analysis is a series of processes in order to validate a string that is received by a language. Understanding the process of reduction rules to become a tree is the part that is difficult to explain.
Wijanarto +2 more
semanticscholar +1 more source
Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints
International Joint Conference on Artificial Intelligence, 2020 Satisfiability (SAT) and Maximum Satisfiability (MaxSAT) are two basic and important constraint problems with many important applications. SAT and MaxSAT are expressed in CNF, which is difficult to deal with cardinality constraints.
Zhendong Lei, Shaowei Cai, Chuan Luo
semanticscholar +1 more source
Analisis Kompeksitas Algoritma CYK untuk Aplikasi dalam Pemrosesan Bahasa Indonesia
RIGGS: Journal of Artificial Intelligence and Digital BusinessPemrosesan Bahasa Alami (Natural Language Processing/NLP) memerlukan parser sintaksis yang mampu menganalisis struktur kalimat secara akurat dan transparan.
R. Maulana +9 more
semanticscholar +1 more source
Design of a Formal Language-Based Traffic Classification System for Smart Cloud Networks
Advanced International Journal for ResearchThe fast rate of data flow, virtualization as well as multi-tenant traffic in today cloud environment has posed new burdens to precise identification, categorization, and control of network traffic.
H. G R, K. M, N. N
semanticscholar +1 more source