Sciweavers

423 search results - page 6 / 85
» Bounded Finite State Controllers
Sort
View
DLT
2006
13 years 9 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
CONCUR
2004
Springer
13 years 11 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
DCC
2006
IEEE
14 years 7 months ago
Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
Amir Ingber, Meir Feder
AUTOMATICA
2008
154views more  AUTOMATICA 2008»
13 years 7 months ago
Approximately bisimilar symbolic models for nonlinear control systems
Control systems are usually modeled by differential equations describing how physical phenomena can be influenced by certain control parameters or inputs. Although these models ar...
Giordano Pola, Antoine Girard, Paulo Tabuada
CORR
2007
Springer
164views Education» more  CORR 2007»
13 years 7 months ago
Capacity Region of the Finite-State Multiple Access Channel with and without Feedback
—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary timeinvariant function of the channel output samples is consider...
Haim H. Permuter, Tsachy Weissman