Decidability Results on the Existence of Lookahead Delegators for NFA Christof Löding and Stefan Repke Lehrstuhl für Informatik 7, RWTH Aachen, Aachen, Germany Abstract

First Page		Document Content
Date: 2014-02-07 10:22:52 Complexity classes Applied mathematics Nondeterministic finite automaton Deterministic finite automaton Lookahead PSPACE-complete NP Theoretical computer science Automata theory Models of computation		Decidability Results on the Existence of Lookahead Delegators for NFA Christof Löding and Stefan Repke Lehrstuhl für Informatik 7, RWTH Aachen, Aachen, Germany Abstract Add to Reading List Source URL: www.automata.rwth-aachen.de Download Document from Source Website File Size: 534,10 KB Share Document on Facebook

	Lebesgue density and Π01 Classes Mushfeq Khan University of Hawai‘i at M¯anoa Algorithmic Randomness and Complexity Shonan Village Center September 12th, 2014 DocID: 1ubuP - View Document
	Rademacher Complexity Margin Bounds for Learning with a Large Number of Classes Vitaly Kuznetsov Courant Institute of Mathematical Sciences, 251 Mercer street, New York, NY, 10012 Mehryar Mohri DocID: 1t1hx - View Document
	Principles of metabolism: coping with complexity Six classes of enzymes DocID: 1sh47 - View Document
	Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester DocID: 1ruap - View Document
	The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University, DocID: 1rtIQ - View Document