<--- Back to Details
First PageDocument Content
Finite automata / Machine learning / Artificial intelligence / Dana Angluin / Finite-state machine / Active learning / Theoretical computer science / Formal languages / Learning / Model checking / Cellular automata / Induction of regular languages
Date: 2018-09-30 08:43:02
Finite automata
Machine learning
Artificial intelligence
Dana Angluin
Finite-state machine
Active learning
Theoretical computer science
Formal languages
Learning
Model checking
Cellular automata
Induction of regular languages

Active Automata Learning in Practice An Annotated Bibliography of the Years 2011 to 2016 Falk Howar1 and Bernhard Steffen2 1 Dortmund University of Technology and Fraunhofer ISST, Dortmund, Germany

Add to Reading List

Source URL: www.falkhowar.de

Download Document from Source Website

File Size: 316,67 KB

Share Document on Facebook

Similar Documents

Finite Horizon Analysis of Markov Automata Dissertation zur Erlangung des akademischen Grades des Doktors der Ingenieurwissenschaften (Dr.-Ing.) der Fakultät für Mathematik und Informatik der Universität des Saarlande

Finite Horizon Analysis of Markov Automata Dissertation zur Erlangung des akademischen Grades des Doktors der Ingenieurwissenschaften (Dr.-Ing.) der Fakultät für Mathematik und Informatik der Universität des Saarlande

DocID: 1xV8b - View Document

Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

DocID: 1vnjH - View Document

Math. Appl), 105–122 DOI: maTWO-DIMENSIONAL JUMPING FINITE AUTOMATA S. JAMES IMMANUEL and D. G. THOMAS Abstract. In this paper, we extend a newly introduced concept called the jumping

Math. Appl), 105–122 DOI: maTWO-DIMENSIONAL JUMPING FINITE AUTOMATA S. JAMES IMMANUEL and D. G. THOMAS Abstract. In this paper, we extend a newly introduced concept called the jumping

DocID: 1uXmk - View Document

Simulating Unary Context-Free Grammars and Pushdown Automata with Finite Automata Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano ITALY

Simulating Unary Context-Free Grammars and Pushdown Automata with Finite Automata Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano ITALY

DocID: 1uOCl - View Document

Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

DocID: 1uNif - View Document