<--- Back to Details
First PageDocument Content
Computability theory / Automata theory / Theory of computation / Models of computation / Church–Turing thesis / Finite-state machine / Algorithm / Decidability / Krohn–Rhodes theory / Theoretical computer science / Computer science / Mathematics
Date: 2013-03-18 10:44:50
Computability theory
Automata theory
Theory of computation
Models of computation
Church–Turing thesis
Finite-state machine
Algorithm
Decidability
Krohn–Rhodes theory
Theoretical computer science
Computer science
Mathematics

Automata theory Regular Cost Functions Contributions of the thesis

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Download Document from Source Website

File Size: 861,57 KB

Share Document on Facebook

Similar Documents

Mathematical Foundations of Automata Theory ´ Jean-Eric Pin Version of June 15, 2018

DocID: 1uKeS - View Document

CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Lecture 15 Andrej Bogdanov

DocID: 1uDy7 - View Document

Theory Comput Syst DOIs00224Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization Marcelo Arenas · Pablo Barceló · Leonid Libkin

DocID: 1tED6 - View Document

Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata

DocID: 1tDnH - View Document

University of Warsaw Faculty of Mathematics, Informatics, and Mechanics Michał Skrzypczak Descriptive set theoretic methods in automata theory

DocID: 1sU9J - View Document