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

Source URL: www.cs.binghamton.edu

• Computing
• Software engineering
• Finite automata
• Compiler construction
• Parallel computing
• Analysis of parallel algorithms
• Speedup
• VTD-XML
• Concurrent data structure
• Finite-state machine
• Regular expression
• Parsing

Equivalence of DFA and NFA • NFA’s are usually easier to “program” in. • Surprisingly, for any NFA N there is a DFA D, such that L(D) = L(N ), and vice versa. • This involves the subset construction, an impor

Source URL: www.cs.ucr.edu

• Finite automata
• Q0
• Powerset construction

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

Source URL: www.cs.binghamton.edu

• 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

A quadratic construction for Zielonka automata with acyclic communication structure∗ Siddharth Krishna Chennai Mathematical Institute, Chennai, India Anca Muscholl LaBRI, Universit´e Bordeaux, France

Source URL: www.labri.fr

COMP 520 FallScanners and Parsers (1) Scanners and parsers

Source URL: www.sable.mcgill.ca

• Software
• Computing
• Compiling tools
• Formal languages
• Finite automata
• Parser generators
• Compiler construction
• Flex
• Printf format string
• Lexical analysis
• GNU bison
• Regular expression

Delft University of Technology Software Engineering Research Group Technical Report Series Parse Table Composition Separate Compilation and Binary

Source URL: swerl.tudelft.nl

• Compiler construction
• Computing
• Parsing
• Automata theory
• Models of computation
• LR parser
• Formal grammar
• Parsing table
• Compiler-compiler
• Formal languages
• Programming language implementation
• Software engineering

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Source URL: schemeworkshop.org

• Formal languages
• Computing
• Automata theory
• Models of computation
• Parsing
• Lexical analysis
• Context-free grammar
• Parse tree
• Regular expression
• Programming language implementation
• Software engineering
• Compiler construction

Synthesis of Asynchronous Systems Sven Schewe and Bernd Finkbeiner Universit¨ at des Saarlandes, 66123 Saarbr¨ ucken, Germany {schewe|finkbeiner}@cs.uni-sb.de

Source URL: cgi.csc.liv.ac.uk

• Applied mathematics
• Ω-automaton
• Finite-state machine
• Scheduling
• Tree automaton
• Alternating finite automaton
• Powerset construction
• Automata theory
• Theoretical computer science
• Computer science

Universit¨at des Saarlandes Naturwissenschaftlich-Technische Fakult¨at 1 Fachrichtung Informatik Bachelor-Studiengang Informatik Bachelor’s Thesis

Source URL: cgi.csc.liv.ac.uk

• Applied mathematics
• Tree automaton
• Finite-state machine
• Alternating finite automaton
• Powerset construction
• Formal language
• Muller automaton
• Automata theory
• Theoretical computer science
• Computer science

Decision Procedures for CTL∗ Oliver Friedmann and Markus Latte Dept. of Computer Science, University of Munich, Germany Abstract. We give an overview over three serious attempts to devise an effective decision method

Source URL: files.oliverfriedmann.de

• Mathematics
• CTL*
• Method of analytic tableaux
• Formal language
• Model checking
• Temporal logic
• Finite-state machine
• Tree automaton
• Powerset construction
• Automata theory
• Theoretical computer science
• Applied mathematics