ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Social Sciences
Literature
Languages
Religion
Research
Law
Architecture and Urbanism
Technology
Economy
all records (73)

Languages
English
Portuguese
Spanish
French
German

Countries
Brazil
Indonesia
USA
South Africa
Spain
Ukraine
Canada
Argentina
Chile
Cuba
all records (79)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
150.694  Articles
1 of 15.070 pages  |  10  records  |  more records»
We prove a Chomsky-Schützenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids. Using this representation we devise a parsing algorithm for a restricted form of those devices.

Context. The problem of increasing efficiency of affix grammars over a finite lattice (AGFL) is considered. AGFL is a context-free grammar with flexible and compact form of productions for parsing texts in natural languages.Objective. The goal of the work... see more

The results of the development of tools for scenario modeling based on formal grammars are presented. The works related to various ways of scenario description in their development systems are analyzed. For the natural language description of scenarios, i... see more

Sticker systems and Watson-Crick automata are two modellings of DNA molecules in DNA computing. A sticker system is a computational model which is coded with single and double-stranded DNA molecules; while Watson-Crick automata is the automata counterpart... see more

In this article we investigate insertion systems of small size in the framework of P systems. We consider P systems with insertion rules having one symbol context and we show that they have the computational power of context-free matrix grammars. If conte... see more

Although testing is an essential part of software development, until re- cently, P system testing has been completely neglected. Mutation testing (mutation analysis) is a structural software testing method which involves modifying the pro- gram in small w... see more

In this paper, we present grammatical descriptions of several polynomials associated with Eulerian polynomials, including q-Eulerian polynomials, alternating run polynomials and derangement polynomials. As applications, we get several convolution formulas... see more

The purpose of this paper is to investigate several context-free grammars suggested by the Lotka-Volterra system. Some combinatorial arrays, involving the Stirling numbers of the second kind and Eulerian numbers, are generated by these context-free g... see more

Inference process try to find a generic answer based on a sample of facts. This process aims to achieve a grammar for a particular language based in string samples that belong or not belong to the specific language. In this work we propose an algorithm fo... see more

1 of 15.070 pages  |  10  records  |  more records»