25 search results - page 2 / 5 » Finite State Automata Representing Two-Dimensional Subshifts |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabil...
CICLING
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
STACS
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
ICTAC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
IJCAI
1993
13 years 7 months ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...