11716 search results - page 79 / 2344 » Computable symbolic dynamics |
171
click to vote
ENC
2003
IEEE
15 years 11 months ago
2003
IEEE
We discuss a set of metrics, which aims to facilitate the formation of symbol groups from a pseudoergodic information source. An optimal codification can then be applied on the sy...
163
click to vote
CAV
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
164
click to vote
SPIN
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
142
click to vote
DCC
2003
IEEE
16 years 5 months ago
2003
IEEE
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
152
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...