512 search results - page 40 / 103 » Automata as Abstractions |
141
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...
149
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We introduce a class of embedded-particle models for describing the emergent computational strategies observed in cellular automata (CAs) that were evolved for performing...
155
click to vote
WIA
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
180
click to vote
GRAMMARS
2000
15 years 6 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
137
click to vote
IMCSIT
2010
15 years 4 months ago
2010
Abstract--There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word h...