<--- Back to Details
First PageDocument Content
Finite automata / Timed automaton / Logic in computer science / Automated planning and scheduling / Fluent / Finite-state machine / Theoretical computer science / Planning Domain Definition Language / Models of computation
Date: 2015-02-02 08:45:53
Finite automata
Timed automaton
Logic in computer science
Automated planning and scheduling
Fluent
Finite-state machine
Theoretical computer science
Planning Domain Definition Language
Models of computation

Microsoft Word - IBSAlgorithms.doc

Add to Reading List

Source URL: foibg.com

Download Document from Source Website

File Size: 150,67 KB

Share Document on Facebook

Similar Documents

Markov models / Concurrency / Graph theory / Markov chain / Stochastic / Petri net / Computing / Mathematics / Formal methods

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

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

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

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

DocID: 1uNif - View Document