DFA minimization - PDFSEARCH.IO - Document Search Engine

DFA minimization
Results: 12

#	Item
1	Learning Regular Omega Languages Dana Angluin1? and Dana Fisman2?? 1 2 Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2014-09-03 16:14:08 Finite automata Formal languages Theoretical computer science -automaton Omega language Regular language Muller automaton Constructible universe Symbol DFA minimization Mathematics Omega-regular language
2	JMLR: Workshop and Conference Proceedings 34:207–217, 2014 Proceedings of the 12th ICGI Induction of Directed Acyclic Word Graph in a Bioinformatics Task Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Applied mathematics Computer science Directed acyclic word graph Deterministic finite automaton Algorithm Machine learning String searching algorithm DFA minimization Finite-state machine Automata theory Models of computation Theoretical computer science
3	Models of Computation Lecture 3: Finite-State Machines [Fa’14] Caveat lector! This is the first edition of this lecture note. A few topics are missing, and there are almost certainly a few serious errors. Please send Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:05:05 Computer science DFA minimization Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Automata theory Models of computation Theoretical computer science
4	Automated Grading of DFA Constructions ∗ Rajeev Alur and Loris D’Antoni Sumit Gulwani Dileep Kini and Mahesh Viswanathan Department of Computer Science Microsoft Research Department of Computer Science Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2013-04-24 11:35:08 Applied mathematics Deterministic finite automaton DFA minimization Nondeterministic finite automaton Regular expression DFA Records Normal distribution Regular language Structure Automata theory Theoretical computer science Computer science
5	Automated Grading of DFA Constructions Rajeev Alur and Loris D’Antoni Sumit Gulwani Dileep Kini and Mahesh Viswanathan Department of Computer Science Microsoft Research Department of Computer Science Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2013-05-16 00:14:15 Model theory Models of computation Formal languages Abstraction Metalogic Deterministic finite automaton Nondeterministic finite automaton Interpretation DFA minimization Automata theory Mathematics Logic
6	Regular Sensing Shaull Almagor1 , Denis Kuperberg2 , and Orna Kupferman1 1 2 The Hebrew University, Israel. Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-10-15 08:28:09 Büchi automaton Regular language DFA minimization Finite-state machine Turing machine Deterministic automaton Ω-automaton Automata theory Theory of computation Theoretical computer science
7	Hyper-Minimization 2 in O(n ) Andrew Badr [removed] CIAA 2008 Add to Reading List Source URL: www.andrewbadr.com Language: English - Date: 2008-07-21 15:34:44 Equivalence class Presentation of a group Computer science Applied mathematics Deterministic finite automaton DFA minimization Automata theory Mathematics Regular language
8	Hyper-Minimization in O(n2 ) Andrew Badr [removed] Flowgram Research Division 650 Townsend #315 San Francisco, CA 94103 Add to Reading List Source URL: www.andrewbadr.com Language: English - Date: 2008-07-27 22:06:23 DFA minimization Regular language Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Automata theory Theoretical computer science Computer science
9	On Languages Piecewise Testable in the Strict Sense James Rogers1 , Jeffrey Heinz2⋆ , Gil Bailey1 , Matt Edlefsen1 , Molly Visscher1 , David Wellcome1 , and Sean Wibel1 1 Add to Reading List Source URL: cs.earlham.edu Language: English - Date: 2011-01-08 11:43:23 Combinatorics on words Theoretical computer science Applied mathematics Regular language String Model theory Structure DFA minimization Formal languages Automata theory Mathematics
10	Symposium on Theoretical Aspects of Computer Science[removed]Bordeaux), pp[removed]www.stacs-conf.org EFFICIENT MINIMIZATION OF DFAS WITH PARTIAL TRANSITION FUNCTIONS ANTTI VALMARI Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2008-02-05 08:15:37 DFA minimization Nondeterministic finite automaton Symbol Mathematics Computing Logic Büchi automaton Automata theory Models of computation Deterministic finite automaton