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:

Desafío: Lenguajes y Autómatas II

Froggy Jumps

Played 0

About this activity

Pon a prueba tus conocimientos sobre lenguajes formales y autómatas.

Created by

Mexico
This game is a version of

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
Desafío: Lenguajes y Autómatas II
 

Froggy Jumps

Desafío: Lenguajes y Autómatas IIOnline version

Pon a prueba tus conocimientos sobre lenguajes formales y autómatas.

by carina vega plata
1

¿Qué es un autómata finito determinista?

2

¿Cuál es la diferencia entre un autómata finito y uno no determinista?

3

¿Qué tipo de lenguajes puede reconocer un autómata de pila?

4

¿Qué es una gramática regular?

5

¿Qué representa el teorema de Chomsky?

6

¿Qué es un lenguaje recursivamente enumerable?

7

¿Qué caracteriza a un autómata de Turing?

8

¿Qué es una función de transición en un autómata?

9

¿Qué tipo de autómata se utiliza para reconocer expresiones regulares?

10

¿Qué es la cerradura de Kleene?

Are you sure you want to leave the page?

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