<--- 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

National School SIDRA 2017: Formal Methods for the Control of Large-scale Networked Nonlinear Systems with Logic Specifications Lecture L4: Regular languages?

DocID: 1v5XV - 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

Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking∗ Roman R. Redziejowski Abstract Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG)

DocID: 1tWkC - View Document

Formal Verification of Code Generators for Modeling Languages (Invited Talk) Xavier Leroy Inria, Paris, France

DocID: 1tNbI - View Document

A Case for Combining Industrial Pragmatics with Formal Methods Eric L. McCorkle I. BACKGROUND A. Dependent Types Dependently-typed languages [9] possess a type system with

DocID: 1tbAh - View Document