Methods for the Transformation of ω-Automata: Complexity and Connection to Second Order Logic Diploma Thesis (Revised Version) Christof L¨oding Supervisor: Prof. Dr. Wolfgang Thomas

Source URL: www.automata.rwth-aachen.de

• Ω-automaton
• Nondeterministic finite automaton
• Muller automaton
• Finite-state machine
• Alternating finite automaton
• Sequence
• Powerset construction
• Automata theory
• Theoretical computer science
• Computer science

Microsoft Word - 03-Lexical-Analysis.doc

Source URL: dragonbook.stanford.edu

• Computing
• Nondeterministic finite automaton
• Lexical analysis
• Powerset construction
• Deterministic finite automaton
• Regular expression
• Finite-state machine
• Formal language
• Regular language
• Automata theory
• Programming language implementation
• Theoretical computer science

NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions Ville Laurikari Helsinki University of Technology Laboratory of Computer Science PL 9700, 02015 TKK, Finland

Source URL: laurikari.net

• Applied mathematics
• Deterministic finite automaton
• Nondeterministic finite automaton
• Finite-state machine
• Regular expression
• Deterministic automaton
• String searching algorithm
• Powerset construction
• Regular language
• Automata theory
• Theoretical computer science
• Computer science

Microsoft PowerPoint - Automata Theory 101.ppt

Source URL: www.cse.unsw.edu.au

• Applied mathematics
• Nondeterministic finite automaton
• Deterministic finite automaton
• Powerset construction
• Ω-automaton
• Regular language
• Regular expression
• Formal language
• Symbol
• Automata theory
• Theoretical computer science
• Computer science

A Note on Phase Transitions and Computational Pitfalls of Learning from Sequences Antoine Cornu´ejols1 & Mich`ele Sebag2 1 AgroParisTech / INRA

Source URL: eprints.pascal-network.org

• Computer science
• Applied mathematics
• Deterministic finite automaton
• Finite-state machine
• Grammar induction
• Algorithm
• Sequence
• Powerset construction
• Automata theory
• Models of computation
• Theoretical computer science

Exact DFA Identification Using SAT Solvers Marijn J.H. Heule1, and Sicco Verwer2 1 2

Source URL: www.st.ewi.tudelft.nl

• Automata theory
• NP-complete problems
• Graph coloring
• Graph theory
• Boolean satisfiability problem
• Deterministic finite automaton
• Clique
• DFA Records
• Powerset construction
• Theoretical computer science
• Mathematics
• Applied mathematics

Recognizing safety and liveness

Source URL: www.cs.cornell.edu

• Computer science
• Büchi automaton
• Finite-state machine
• Powerset construction
• Infinite tree automaton
• Ω-automaton
• Automata theory
• Theoretical computer science
• Models of computation

2002 Paper 1 Question 8 Discrete Mathematics Let Ω be a set. Write P(Ω) for its powerset. Recall the definition of the intersection of B ⊆ P(Ω): \

Source URL: www.cl.cam.ac.uk

LNCS[removed]A General Weighted Grammar Library

Source URL: www.cs.mun.ca

• Computer science
• Applied mathematics
• Context-free grammar
• Regular grammar
• Regular expression
• Stochastic context-free grammar
• Powerset construction
• Regular language
• Finite state transducer
• Automata theory
• Formal languages
• Theoretical computer science

The Design Principles of a Weighted Finite-State Transducer Library Mehryar Mohri, Fernando Pereira and Michael Riley AT&T Labs — Research 180 Park Avenue, Florham Park, NJ[removed]

Source URL: www.cs.mun.ca

• Applied mathematics
• Models of computation
• Finite state transducer
• Semiring
• Shortest path problem
• Algorithm
• Floyd–Warshall algorithm
• Powerset construction
• Theoretical computer science
• Automata theory
• Mathematics