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:

Autómatas: Verdadero o Falso

Yes or No

Played 1

About this activity

Quiz sobre autómatas y lenguajes

Created by

Mexico

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
Autómatas: Verdadero o Falso
 

Autómatas: Verdadero o FalsoOnline version

Quiz sobre autómatas y lenguajes

by Idhaly Vanessa
1

Todos los autómatas trabajan con un alfabeto binario {0,1}.

2

Los autómatas de pila pueden reconocer lenguajes que no son regulares, como el lenguaje {a^n b^n}.

3

En un autómata de Moore, la salida depende del estado en el que se encuentra.

4

Un autómata de Turing es menos poderoso que un autómata finito.

5

Un autómata finito determinista tiene un estado inicial y transiciones definidas para cada símbolo del alfabeto.

6

Un autómata finito no puede contar arbitrariamente ni verificar igualdades entre cantidades infinitas de símbolos.

7

Un DFA puede cambiar de estado sin consumir ningún símbolo de entrada.

8

Un autómata finito puede reconocer todos los lenguajes no regulares.

9

En un autómata de Moore, la salida depende directamente del símbolo leído.

10

Un DFA no necesita memoria más allá de su estado actual para decidir si la cadena pertenece al lenguaje.

Are you sure you want to leave the page?

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