DICLIB.COM
Herramientas lingüísticas IA

Todas las herramientas Suscripción Contáctenos

Ingrese una palabra o frase en cualquier idioma 👆

Idioma:

Traducción y análisis de palabras por inteligencia artificial

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

cómo se usa la palabra
frecuencia de uso
se utiliza con más frecuencia en el habla oral o escrita
opciones de traducción
ejemplos de uso (varias frases con traducción)
etimología

Qué (quién) es recognizable$67485$ - definición

FORMAL LANGUAGE

Partially decidable language; Turing-recognizable language; Turing recognizable; R.e. language; Nonrecursively enumerable; Recognizable language; Turing-acceptable language; Type-0 language; Recursively enumerable languages

Recursively enumerable language

In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e.

https://en.wikipedia.org/wiki/Recursively_enumerable_language

Recognizable set

In computer science, more precisely in automata theory, a recognizable set of a monoid is a subset that can be distinguished by some morphism to a finite monoid. Recognizable sets are useful in automata theory, formal languages and algebra.

https://en.wikipedia.org/wiki/Recognizable_set

Automatic sequence

AN INFINITE SEQUENCE OF TERMS CHARACTERIZED BY A FINITE AUTOMATON

Automatic set; Automatic real number; Period-doubling sequence; Cobham–Semenov theorem; K-automatic sequence; Cobham-Semenov theorem; Automatic sequences

In mathematics and theoretical computer science, an automatic sequence (also called a k-automatic sequence or a k-recognizable sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton. The n-th term of an automatic sequence a(n) is a mapping of the final state reached in a finite automaton accepting the digits of the number n in some fixed base k.

https://en.wikipedia.org/wiki/Automatic_sequence

Wikipedia

Recursively enumerable language

In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e., if there exists a Turing machine which will enumerate all valid strings of the language.

Recursively enumerable languages are known as type-0 languages in the Chomsky hierarchy of formal languages. All regular, context-free, context-sensitive and recursive languages are recursively enumerable.

The class of all recursively enumerable languages is called RE.

https://en.wikipedia.org/wiki/Recursively enumerable language