New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Alfabeto y Cadenas: Verdadero/Falso

Yes or No

Played 0

About this activity

Verdadero o falso sobre alfabetos y cadenas

Created by

Guatemala

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Alfabeto y Cadenas: Verdadero/Falso
 

Alfabeto y Cadenas: Verdadero/FalsoOnline version

Verdadero o falso sobre alfabetos y cadenas

by SERGIO RENE GARCIA TUNAY
1

Los lenguajes no regulares pueden ser representados por autómatas finitos (falso: solo los regulares).

2

Ejemplos de alfabetos incluyen: {1,2,3,4,5,6,7,8,9,0}.

3

Un AFD tiene una única trayectoria para cada cadena de entrada.

4

Un lenguaje es un conjunto de cadenas que utiliza símbolos de un alfabeto definido.

5

El proceso de hominización no es tema de los lenguajes formales (correcto: no se usa en este contexto).

6

La notación L1 = {33792, 15777, 931997} no es un lenguaje formal sino letras sueltas.

7

Un alfabeto es un conjunto no vacío y finito de símbolos.

8

Los lenguajes formales se caracterizan por reglas y símbolos.

9

Un AFD acepta un conjunto de cadenas que cumplen con su función de transición.

10

La transición entre estados en un AFD no depende del símbolo de entrada (falso: depende del símbolo).

11

La autodeterminación de un AFD implica múltiples trayectorias para una misma cadena de entrada (falso: una única trayectoria).

12

El alfabeto L1 = {!, _, -, ¿} contiene una omisión importante y no es válido.

13

Un alfabeto L1 = {!, _, -, ¿} puede usarse para formar cadenas.

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.