Searching for "Erratum to "New upper bounds to the limitedness of distance automata"." – sorted by Relevance.
-
The Topological Approach to the Limitedness Problem on Distance Automata
- The topological approach to the limitedness problem on distance automata Hing Leung 1 Introduction
- Cited by 6 (1 self) – Add To MetaCart
-
ERRATUM
- has yet demonstrated upper bounds on what a cache or local memory could achieve when exploiting both
- Add To MetaCart
-
The Nesting-Depth of Disjunctive µ-calculus for Tree Languages and the Limitedness Problem
- a new proof [8] using the notion of nested distance desert automata. These automata compute a value
- Add To MetaCart
-
Erratum
- Erratum In the article “Algorithms for Chordal Analysis” by Bryan Pardo and William P. Birmingham
- Add To MetaCart
-
Upper bounds on separating codes
- , such as automata theory, digital fingerprinting, group testing, and hashing. In this paper, we derive upper bounds
- Cited by 1 (0 self) – Add To MetaCart
-
On Finite Automata With Limited Nondeterminism
- that the upper bounds obtained are almost tight. We also show that the limitedness problem of the number
- Cited by 4 (1 self) – Add To MetaCart
-
A New Tight Upper Bound on the Transposition Distance
- A New Tight Upper Bound on the Transposition Distance Anthony Labarre ⋆ Université Libre de
- Cited by 2 (1 self) – Add To MetaCart
-
R-automata ⋆
- the factorization forest theorem was used to solve the limitedness problem for distance automata in [Sim94]. We also
- Add To MetaCart
-
New Upper Bounds on Error Exponents
- New upper bounds on error exponents Simon Litsyn Department of Electrical Engineering-Systems Tel
- Cited by 23 (6 self) – Add To MetaCart
-
New Upper Bounds for Maximum Satisfiability
- New Upper Bounds for Maximum Satisfiability # Rolf Niedermeier + Wilhelm-Schickard-Institut fur
- Cited by 24 (2 self) – Add To MetaCart

