<--- Back to Details
First PageDocument Content
Theoretical computer science / Regular language / String / Regular expression / Kleene star / Formal grammar / Concatenation / Empty string / Deterministic finite automaton / Formal languages / Mathematics / Combinatorics
Date: 2014-12-28 09:05:01
Theoretical computer science
Regular language
String
Regular expression
Kleene star
Formal grammar
Concatenation
Empty string
Deterministic finite automaton
Formal languages
Mathematics
Combinatorics

Add to Reading List

Source URL: web.engr.illinois.edu

Download Document from Source Website

File Size: 221,12 KB

Share Document on Facebook

Similar Documents

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

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

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

Advantages and challenges of programming the Micron Automata Processor

DocID: 1qtpN - View Document

Finite automata / Computability / Deterministic automaton / Computational complexity theory / Deterministic finite automaton / Finite-state machine / Regular language / Reduction / Algorithm / Theoretical computer science / Mathematics / Cognitive science

J. EDUCATIONAL COMPUTING RESEARCH, Vol, 2005 SOLVING PROBLEMS REDUCTIVELY MICHAL ARMONI The Open University of Israel and School of Education, Tel-Aviv University

DocID: 1q9lF - View Document

Finite automata / Compiler construction / Parallel computing / Analysis of parallel algorithms / Speedup / VTD-XML / Concurrent data structure / Finite-state machine / Regular expression / Deterministic finite automaton / Parsing / XML schema

Performance Enhancement with Speculative Execution Based Parallelism for Processing Large-scale XML-based Application Data Michael R. Head

DocID: 1pKU9 - View Document

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,

DocID: 1pG49 - View Document