Sciweavers

23 search results - page 2 / 5
» Testability of Oracle Automata
Sort
View
LATA
2011
Springer
12 years 10 months ago
Classifying Regular Languages via Cascade Products of Automata
Abstract. Building on the celebrated Krohn-Rhodes Theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those c...
Marcus Gelderie
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 6 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
14 years 2 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
ICGI
2010
Springer
13 years 8 months ago
Enhanced Suffix Arrays as Language Models: Virtual k-Testable Languages
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
Herman Stehouwer, Menno van Zaanen
EUROCAST
2001
Springer
106views Hardware» more  EUROCAST 2001»
13 years 12 months ago
On CAST.FSM Computation of Hierarchical Multi-layer Networks of Automata
CAST.FSM denotes a CAST tool which has been developed at the Institute of Systems Science at the University of Linz during the years 1986-1993. The first version of CAST.FSM was i...
Michael Affenzeller, Franz Pichler, Rudolf Mittelm...