Sciweavers

644 search results - page 98 / 129
» Precedence Automata and Languages
Sort
View
IJFCS
2007
105views more  IJFCS 2007»
13 years 8 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
LATA
2010
Springer
14 years 3 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel
CAV
2007
Springer
98views Hardware» more  CAV 2007»
14 years 2 months ago
UPPAAL-Tiga: Time for Playing Games!
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototy...
Gerd Behrmann, Agnès Cougnard, Alexandre Da...
ESOP
2007
Springer
14 years 2 months ago
Probabilistic Anonymity Via Coalgebraic Simulations
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...
Ichiro Hasuo, Yoshinobu Kawabe
ICALP
1994
Springer
14 years 18 days ago
On some Relations between Dynamical Systems and Transition Systems
Abstract. In this paper we de ne a precise notion of abstraction relation between continuous dynamical systems and discrete state-transition systems. Our main result states that ev...
Eugene Asarin, Oded Maler