| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910453484003321 |
|
|
Autore |
Wedde Ian |
|
|
Titolo |
The lifeguard : poems, 2008-2013 / / Ian Wedde |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Auckland, New Zealand : , : Auckland University Press, , 2013 |
|
|
|
|
|
|
|
ISBN |
|
1-86940-774-1 |
1-77558-650-2 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (97 p.) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
New Zealand literature |
New Zealand poetry |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di contenuto |
|
Cover; CONTENTS; The Lifeguard; Help!; Another bottle of oil; Help!; The Look; Three Elegies; Harry Martens; Mahmoud Darwish; Oum Kalsoum; Shadow Stands Up |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
?You have to start somewhere / in these morose times' begins the title sequence of this collection, in which the dual, duelling lifeguards of east and west, sunrise and sunset, glib Narcissus and one-eyed Polyphemus, watch over a collection that explores the contradictions between life's pool-side surfaces and frightening undertows. Ian Wedde's poet laureate collection, dedicated to his grandchildren Bella and Sebo, opens with a major new series ?The Lifeguard', and finishes with a second long sequence, ?Shadow Stands Up', in which a world of Platonic memory and tidal recurrence is observ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996465422103316 |
|
|
Titolo |
1. Fachtagung über Automatentheorie und Formale Sprachen [[electronic resource] ] : GI. Gesellschaft für Informatik e.V. Bonn, 9.-12. Juli 1973 / / herausgegeben von Karl-Heinz Böhling, Klaus Indermark |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1973 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1973.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 330 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 2 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer programming |
Computers |
Mathematical logic |
Programming Techniques |
Computation by Abstract Devices |
Mathematical Logic and Formal Languages |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
On the structure of algorithmic problems -- A mathematical model of digital computers -- On some recent problems concerning developmental languages -- Fault-tolerance and stability of fuzzy-state automata -- Bemerkungen über Homomorphismen endlicher in lineare Automaten -- Der Kaskadenzerlegungssatz für Halbautomaten -- Konvergenzbetrachtungen bei der Vorhersage des Ausgabeverhaltens allgemeiner stochastischer Systeme -- Ketten und arithmetische Prädikate von endlichen Automaten -- Une hierarchie infinie de cones d'Accepteurs verificateurs -- Zustandsfolgenabbildungen von verallgemeinerten endlichen Automaten -- Ein automatentheoretisches Modell einer Speicherhierarchie -- Deterministic one-counter automata -- The use of metric and uniform spaces for the formalization of behavioral proximity of states -- Quelques generateurs des langages algebriques -- Une caracterisation des langages quasi-rationnels standards -- Der Einfluss von Kontext auf spezielle CF-Grammatiken -- Zur Komplexität |
|
|
|
|
|
|
|
|
|
|
gesteuerter kontextfreier Ersetzungen -- Characterization of derivation sets of formal systems -- Die Darstellung indizierter Sprachen durch Ausdrücke -- Codes and aperiodic languages -- The characterization of certain classes of languages in the context sensitive area by automata -- A characterization of boolean closures of families of languages -- Zufällige Folgen und Bi-Immunität -- Die mittler Additionsdauer eines Paralleladdierwerks -- On the number of multiplications required by the product of two matrices -- Elementare und subelementare Funktionenklassen über binären Bäumen -- Über die Vernetzungsstruktur von Maschinen -- On the simulation of time bounded machines -- Über die Zeit, die benötigt wird, um endliche Mengen umzuordnen -- Über eine Hierarchie von Push-Down-Entscheidbaren Mengen -- A characterization of the classes L1 and R1 of primitive recursive word functions -- A drum scheduling algorithm -- Some considerations about classes of mappings between context-free derivation systems -- On ianov schemas with one memory location -- Reduction goals in bottom-up recognition -- Un modele semantique pour un langage simple de programmation -- Erweiterungen subrekursiver Programmiersprachen. |
|
|
|
|
|
| |