Automata construction

Results: 60



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

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

Add to Reading List

Source URL: www.cs.binghamton.edu

Language: English - Date: 2013-07-27 18:42:38
2Finite automata / Q0 / Powerset construction

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

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2015-01-28 19:24:36
3Finite 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

Add to Reading List

Source URL: www.cs.binghamton.edu

Language: English - Date: 2009-04-08 20:31:37
4

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

Add to Reading List

Source URL: www.labri.fr

Language: English - Date: 2015-10-15 03:16:32
    5Software / Computing / Compiling tools / Formal languages / Finite automata / Parser generators / Compiler construction / Flex / Printf format string / Lexical analysis / GNU bison / Regular expression

    COMP 520 FallScanners and Parsers (1) Scanners and parsers

    Add to Reading List

    Source URL: www.sable.mcgill.ca

    Language: English - Date: 2007-09-23 21:06:13
    6Compiler construction / Computing / Parsing / Automata theory / Models of computation / LR parser / Formal grammar / Parsing table / Compiler-compiler / Formal languages / Programming language implementation / Software engineering

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

    Add to Reading List

    Source URL: swerl.tudelft.nl

    Language: English - Date: 2008-12-30 16:24:40
    7Formal languages / Computing / Automata theory / Models of computation / Parsing / Lexical analysis / Context-free grammar / Parse tree / Regular expression / Programming language implementation / Software engineering / Compiler construction

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

    Add to Reading List

    Source URL: schemeworkshop.org

    Language: English - Date: 2011-08-12 16:48:41
    8Applied mathematics / Ω-automaton / Finite-state machine / Scheduling / Tree automaton / Alternating finite automaton / Powerset construction / Automata theory / Theoretical computer science / Computer science

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

    Add to Reading List

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

    Language: English - Date: 2008-09-22 13:39:05
    9Applied mathematics / Tree automaton / Finite-state machine / Alternating finite automaton / Powerset construction / Formal language / Muller automaton / Automata theory / Theoretical computer science / Computer science

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

    Add to Reading List

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

    Language: English - Date: 2008-09-29 06:47:38
    10Mathematics / 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

    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

    Add to Reading List

    Source URL: files.oliverfriedmann.de

    Language: English - Date: 2012-02-10 07:43:07
    UPDATE