47 search results - page 4 / 10 » On the Recognizability of Self-generating Sets |
FCT
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
CAI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
FFA
2008
14 years 9 months ago
2008
Syntactical properties of representations of integers in various number systems are well-known and have been extensively studied. In this paper, we transpose the notion of recogniz...
72
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...