Sciweavers

2467 search results - page 128 / 494
» Finite State Machines
Sort
View
CICLING
2008
Springer
15 years 8 months ago
Arabic Morphology Parsing Revisited
In this paper we propose a new approach to the description of Arabic morphology using 2-tape finite state transducers, based on a particular and systematic use of the operation of ...
Suhel Jaber, Rodolfo Delmonte
IEICET
2006
76views more  IEICET 2006»
15 years 6 months ago
Relationship among Complexities of Individual Sequences over Countable Alphabet
This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...
Shigeaki Kuzuoka, Tomohiko Uyematsu
TCS
2008
15 years 6 months ago
Petri nets are less expressive than state-extended PA
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...
Mojmír Kretínský, Vojtech Reh...
AWPN
2008
273views Algorithms» more  AWPN 2008»
15 years 8 months ago
An Approach to Tackle Livelock-Freedom in SOA
We calculate a fixed finite set of state space fragments for a service P, where each fragment carries a part of the whole behavior of P. By composing these fragments according to t...
Christian Stahl, Karsten Wolf
COLT
2008
Springer
15 years 8 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin