Results 11 to 20 of about 8,162,755 (77)
Es un hecho conocido que toda gramática libre de contexto puede ser transformada a la forma normal de Chomsky de tal forma que los lenguajes generados por las dos gramáticas son equivalentes.
Fredy Ángel Miguel Amaya Robayo +1 more
doaj +1 more source
Why Chomsky Normal Form: A Pedagogical Note [PDF]
To simplify the design of compilers, Noam Chomsky proposed to first transform a description of a programming language -- which is usually given in the form of a context-free grammar -- into a simplified normal form.
Kreinovich, Vladik, Kosheleva, Olga
core +1 more source
An upper bound for validity limits of asymptotic analytical approaches based on normal form theory [PDF]
Perturbation methods are routinely used in all fields of applied mathematics where analytical solutions for nonlinear dynamical systems are searched.
LAMARQUE, Claude-Henri +2 more
core +1 more source
Justification for inclusion dependency normal form [PDF]
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases.
Vincent, Millist W., Levene, Mark
core +7 more sources
Conferència de Noam Chomsky en el marc del Seminari Noam Chomsky Language and the “cognitive revolutions”chomsky_01c ...
Chomsky, Noam
core +3 more sources
Conferència de Noam Chomsky en el marc del Seminari Noam Chomsky: Language and the "cognitive revolutions"chomsky_08c ...
Chomsky, Noam
core +3 more sources
In the original publication, the author Noam Chomsky was missing. The complete list of authors is given above.
Reynolds, Louis, Chomsky, Avram Noam
core +1 more source
Conferència de Noam Chomsky en el marc del Seminari Noam Chomsky Language and the “cognitive revolutions”chomsky_10b ...
Chomsky, Noam
core +3 more sources
Conferència de Noam Chomsky en el marc del Seminari Noam Chomsky Language and the “cognitive revolutions”chomsky_06b ...
Chomsky, Noam
core +2 more sources
Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing [PDF]
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and telecommunication, solutions can often be found more efficiently by
Haesol Im +16 more
semanticscholar +1 more source

