| Records |
| Author |
Cenzer, D.; Dashti, A.; Toska, F.; Wyman, S. |
| Title |
Computability of Countable Subshifts |
Type |
Conference Article |
| Year |
2010 |
Publication |
Computability in Europe (CiE) |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
88-97 |
| Keywords |
|
| Abstract |
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of Cantor-Bendixson rank one contain only eventually periodic elements. Any rank one subshift , in which every limit point is periodic, is decidable. Subshifts of rank two may contain members of arbitrary Turing degree. In contrast, effectively closed ($ 1^0$) subshifts of rank two contain only computable elements, but $ 1^0$ subshifts of rank three may contain members of arbitrary c. e. degree. There is no subshift of rank ω. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
Lecture Notes in Computer Science |
Abbreviated Series Title |
|
Series Volume  |
6158 |
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
|
Approved |
no |
| Call Number |
refbase @ user @ Cdtw2010 |
Serial |
20178 |
| Permanent link to this record |
| |
|
| |
| Author |
Alegria, I.; Etxeberria, I.; Hulden, M.; Maritxalar, M. |
| Title |
Porting Basque morphological grammars to foma, an open-source tool |
Type |
Book Chapter |
| Year |
2010 |
Publication |
Finite-State Methods and Natural Language Processing |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
105-113 |
| Keywords |
|
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer Berlin / Heidelberg |
Place of Publication |
|
Editor |
Yli-Jyrä, A.; Kornai, A.; Sakarovitch, J.; Watson, B. |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
Lecture Notes in Computer Science |
Abbreviated Series Title |
|
| Series Volume |
6062 |
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
|
Approved |
no |
| Call Number |
refbase @ user @ alegria10ic |
Serial |
630 |
| Permanent link to this record |
| |
|
| |
| Author |
Alegria, I.; Etxeberria, I.; Hulden, M.; Maritxalar, M. |
| Title |
Porting Basque morphological grammars to foma, an open-source tool |
Type |
Book Chapter |
| Year |
2010 |
Publication |
Finite-State Methods and Natural Language Processing |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
105-113 |
| Keywords |
|
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer Berlin / Heidelberg |
Place of Publication |
|
Editor |
Yli-Jyrä, A.; Kornai, A.; Sakarovitch, J.; Watson, B. |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
Lecture Notes in Computer Science |
Abbreviated Series Title |
|
| Series Volume |
6062 |
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
|
Approved |
no |
| Call Number |
refbase @ user @ alegria10ic |
Serial |
5946 |
| Permanent link to this record |
| |
|
| |
| Author |
Berthold, J.; Dieterle, M.; Loogen, R. |
| Title |
Implementing parallel Google map-reduce in Eden |
Type |
Book Chapter |
| Year |
2009 |
Publication |
Euro-Par 2009 Parallel Processing |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
990-1002 |
| Keywords |
|
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer Berlin / Heidelberg |
Place of Publication |
|
Editor |
Sips, H.; Epema, D.; Lin, H.-X. |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
Lecture Notes in Computer Science |
Abbreviated Series Title |
|
| Series Volume |
5704 |
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
|
Approved |
no |
| Call Number |
refbase @ user @ berthold09ic |
Serial |
673 |
| Permanent link to this record |
| |
|
| |
| Author |
Sastre, J.M. |
| Title |
Efficient Parsing Using Filtered-Popping Recursive Transition Networks |
Type |
Book Chapter |
| Year |
2009 |
Publication |
Implementation and Application of Automata |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
241-244 |
| Keywords |
|
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer-Verlag |
Place of Publication |
|
Editor |
Maneth, S. |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
Lecture Notes in Computer Science |
Abbreviated Series Title |
|
| Series Volume |
5642 |
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
|
Approved |
no |
| Call Number |
refbase @ user @ sastre09icb |
Serial |
1084 |
| Permanent link to this record |
