This is TikiWiki v1.9.8.3 -Sirius- © 2002–2007 by the Tiki community Tue 18 of Jun, 2024 [13:04 UTC]

Category F. Theory of Computation

Browse in:
All Wiki pages Image galleries Images File galleries Blogs Trackers Items Surveys Articles

search category: deep:

Show subcategories objects


Objects (2)

Article METHOD AND ALGORITHM FOR MINIMIZATION OF PROBABILISTIC AUTOMATA Abstract: The theory of probabilistic automata is still evolving discipline of theory of information. As in classical theory of automata, it might be a base for computations, can be exploited in desig 
Article MINIMIZATION OF REACTIVE PROBABILISTIC AUTOMATA Abstract: The problem of finite automata minimization is important for software and hardware designing. Different types of automata are used for modeling systems or machines with finite number of sta 

Page: 1/1
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.21 secs ]   [ Memory usage: 9.07MB ]   [ GZIP Disabled ]   [ Server load: 0.36 ]