<--- Back to Details
First PageDocument Content
Theoretical computer science / Applied mathematics / Models of computation / Regular language / Nondeterministic finite automaton / Model checking / Permutation / Structure / Büchi automaton / Automata theory / Formal languages / Mathematics
Date: 2002-01-07 08:27:59
Theoretical computer science
Applied mathematics
Models of computation
Regular language
Nondeterministic finite automaton
Model checking
Permutation
Structure
Büchi automaton
Automata theory
Formal languages
Mathematics

BRICS Basic Research in Computer Science ´ BRICS RSEsik & Ito: Temporal Logic with Cyclic Counting

Add to Reading List

Source URL: www.brics.dk

Download Document from Source Website

File Size: 254,05 KB

Share Document on Facebook

Similar Documents

On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1  Institute of Theoretical Computer Science and Center of Advancing

On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing

DocID: 1rggm - View Document

Session F2C NON-DETERMINISM IN CS HIGH-SCHOOL CURRICULA Michal Armoni 1 and Judith Gal-Ezer 2 Abstract - One of the units in the relatively new high school CS curriculum which is being implemented in Israel is a

Session F2C NON-DETERMINISM IN CS HIGH-SCHOOL CURRICULA Michal Armoni 1 and Judith Gal-Ezer 2 Abstract - One of the units in the relatively new high school CS curriculum which is being implemented in Israel is a

DocID: 1qIve - View Document

Advantages and challenges of programming the Micron Automata Processor

Advantages and challenges of programming the Micron Automata Processor

DocID: 1qtpN - View Document

MCS 441 – Theory of Computation I Spring 2016 Problem Set 1 Lev Reyzin Due: at the beginning of class Instructions: Atop your problem set, please write your name and whether you are an undergraduate or graduate

MCS 441 – Theory of Computation I Spring 2016 Problem Set 1 Lev Reyzin Due: at the beginning of class Instructions: Atop your problem set, please write your name and whether you are an undergraduate or graduate

DocID: 1q50x - View Document

Parallel Processing of Large-Scale XML-Based Application Documents on Multi-core Architectures with PiXiMaL Michael R. Head† Madhusudhan Govindaraju‡ Grid Computing Research Laboratory, SUNY Binghamton, NY {† mike,

Parallel Processing of Large-Scale XML-Based Application Documents on Multi-core Architectures with PiXiMaL Michael R. Head† Madhusudhan Govindaraju‡ Grid Computing Research Laboratory, SUNY Binghamton, NY {† mike,

DocID: 1pG49 - View Document