Sciweavers

110 search results - page 8 / 22
» Mean-Payoff Automaton Expressions
Sort
View
COLING
2008
13 years 10 months ago
Quantification and Implication in Semantic Calendar Expressions Represented with Finite-State Transducers
This paper elaborates a model for representing semantic calendar expressions (SCEs), which correspond to the intensional meanings of natural-language calendar phrases. The model u...
Jyrki Niemi, Kimmo Koskenniemi
QEST
2008
IEEE
14 years 2 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 8 months ago
Simulations between triangular and hexagonal number-conserving cellular automata
Abstract. A number-conserving cellular automaton is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its ...
Katsunobu Imai, Bruno Martin
CORR
2009
Springer
115views Education» more  CORR 2009»
13 years 6 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
FOSSACS
2008
Springer
13 years 10 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen