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

Source URL: korrekt.org

• Computational complexity theory
• Finite automata
• Complexity classes
• Theory of computation
• Nondeterministic finite automaton
• Regular language
• PSPACE
• Bchi automaton
• FO
• Permutation
• IP
• Structure

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

Source URL: www.openu.ac.il

• Finite automata
• Automata theory
• Nondeterministic finite automaton
• Deterministic automaton
• Theoretical computer science
• Finite-state machine
• Deterministic finite automaton
• Computability
• Regular language
• NP
• Muller automaton
• Bchi automaton

Advantages and challenges of programming the Micron Automata Processor

Source URL: ontopilot.com

• Finite automata
• Mathematics
• Science and technology
• Mathematical analysis
• Nondeterministic finite automaton
• Finite-state machine
• Automaton
• John von Neumann
• Deterministic finite automaton

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

Source URL: homepages.math.uic.edu

• Finite automata
• Regular language
• Nondeterministic finite automaton

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,

Source URL: www.cs.binghamton.edu

• Finite automata
• Parallel computing
• Microprocessors
• Analysis of parallel algorithms
• Nondeterministic finite automaton
• Multi-core processor
• Thread
• Regular expression
• Finite-state machine
• Speedup
• Deterministic finite automaton
• Multiprocessing

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,

Source URL: www.cs.binghamton.edu

• Finite automata
• Parallel computing
• Microprocessors
• Analysis of parallel algorithms
• Nondeterministic finite automaton
• Multi-core processor
• Thread
• Regular expression
• Finite-state machine
• Speedup
• Deterministic finite automaton
• Multiprocessing

MCS 441 – Theory of Computation I Spring 2016 Problem Set 2 Lev Reyzin Due: at the beginning of class

Source URL: homepages.math.uic.edu

• Finite automata
• Formal languages
• Regular language
• Generalized nondeterministic finite automaton
• Pumping lemma for context-free languages
• Nondeterministic finite automaton

RAPID Programming of Pattern-Recognition Processors Kevin Angstadt Westley Weimer Kevin Skadron

Source URL: cap.virginia.edu

• Finite automata
• Software engineering
• Computer programming
• Software
• Nondeterministic finite automaton
• Automata theory
• Finite-state machine
• Lex
• Regular expression
• Macro
• Pattern matching

PII:

Source URL: www.cis.upenn.edu

• Finite automata
• Timed automaton
• Muller automaton
• Deterministic automaton
• Finite-state machine
• Regular language
• Nondeterministic finite automaton
• Alphabet
• Automata theory
• -automaton

Nondeterministic Finite Automata in Hardware - the Case of the Levenshtein Automaton Tommy Tracy II, Mircea Stan, Nathan Brunelle, Jack Wadden, Ke Wang, Kevin Skadron, Gabriel Robins University of Virginia Charlottesvill

Source URL: cap.wpengine.com