3965 search results - page 205 / 793 » Effectivity of Regular Spaces |
167
click to vote
BIRTHDAY
2004
Springer
15 years 12 months ago
2004
Springer
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...
159
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
This paper explores and discusses the application of Software Agent in pattern layout design. First we introduce Pattern Decomposition Representation Model (PDM). By combining Agen...
170
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
155
click to vote
ACL
2008
15 years 8 months ago
2008
In morphologically rich languages such as Arabic, the abundance of word forms resulting from increased morpheme combinations is significantly greater than for languages with fewer...
140
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...