<--- Back to Details
First PageDocument Content
Formal languages / Mathematics / Language / Combinatorics / Context-free language / Regular language / Context-free grammar / Kleene star / Regular expression / Omega-regular language / Complementation of Bchi automaton
Date: 2018-10-25 12:43:22
Formal languages
Mathematics
Language
Combinatorics
Context-free language
Regular language
Context-free grammar
Kleene star
Regular expression
Omega-regular language
Complementation of Bchi automaton

Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs

Add to Reading List

Source URL: jorgenavas.github.io

Download Document from Source Website

File Size: 746,31 KB

Share Document on Facebook

Similar Documents

Perl regular expression puzzle: even zeros and odd ones Greg Bacon  The challenge was to write a regular expression — subject to seemingly tight constraints: only literals, concatenation, Kleene star,

Perl regular expression puzzle: even zeros and odd ones Greg Bacon The challenge was to write a regular expression — subject to seemingly tight constraints: only literals, concatenation, Kleene star,

DocID: 1vc3D - View Document

Formal Grammars and Languages  1 Tao Jiang

Formal Grammars and Languages 1 Tao Jiang

DocID: 1qE1D - View Document

PDF Document

DocID: 17shy - View Document

Theory of computation: Summary of main concepts  3. Finite automata and regular languages: theory State Minimization

Theory of computation: Summary of main concepts 3. Finite automata and regular languages: theory State Minimization

DocID: cWYQ - View Document

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events Dexter Kozen Department of Computer Science Cornell University

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events Dexter Kozen Department of Computer Science Cornell University

DocID: 996t - View Document