iPhoneAlle anzeigen
iPhone 11iPhone 11 ProiPhone 11 Pro MaxiPhone 12iPhone 12 ProiPhone 12 Pro MaxiPhone 12 miniiPhone 13iPhone 13 ProiPhone 13 Pro MaxiPhone 13 miniiPhone 14iPhone 14 PlusiPhone 14 ProiPhone 14 Pro MaxiPhone 15iPhone 15 PlusiPhone 15 ProiPhone 15 Pro MaxiPhone 16iPhone 16 PlusiPhone 16 ProiPhone 16 Pro MaxiPhone 16eiPhone 8iPhone 8 PlusiPhone SE 2020iPhone SE 2022iPhone XiPhone XRiPhone XSiPhone XS Max
Galaxy A-SerieAlle anzeigen
Galaxy A12Galaxy A13Galaxy A13 5GGalaxy A14Galaxy A15Galaxy A16Galaxy A17 5GGalaxy A20eGalaxy A21Galaxy A22Galaxy A23Galaxy A24Galaxy A25Galaxy A26 5GGalaxy A32Galaxy A33Galaxy A34Galaxy A35Galaxy A36 5GGalaxy A40Galaxy A41Galaxy A42Galaxy A50Galaxy A51Galaxy A52Galaxy A53Galaxy A54Galaxy A55Galaxy A56 5GGalaxy A70Galaxy A71Galaxy A72
Redmi SeriesAlle anzeigen
Redmi 10Redmi 13CRedmi 15 5GRedmi Note 10Redmi Note 10 ProRedmi Note 11Redmi Note 11 ProRedmi Note 11 Pro Plus 5GRedmi Note 11sRedmi Note 12Redmi Note 12 5GRedmi Note 12 ProRedmi Note 12 Pro 5GRedmi Note 12 Pro PlusRedmi Note 13Redmi Note 13 5GRedmi Note 13 ProRedmi Note 13 Pro PlusRedmi Note 14Redmi Note 14 Pro PlusRedmi Note 8Redmi Note 8 ProRedmi Note 9Redmi Note 9 Pro
Derzeit nicht verfügbar
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Optischer Zustand
Beschreibung
The subject of this monograph are restarting automata. The definition of these automata is motivated by the linguistic technique of analysis by reduction. This technique, which can be used to analyze sentences in natural languages with a rather free word-order like Czech (or Latin or German), consists of a sequence of step-by-step simplifications of a given sentence. Each of these simplifications… is realized by a single reduction operation, which consists of either the deletion of one or several words from that sentence or the replacement of a (possibly discontinuous) substring of that sentence by a shorter substring. It is required that each application of such a reduction operation must preserve the syntactical correctness of the sentence. Accordingly, a restarting automaton consists of a finite-state control, a flexible tape that initially contains the input, and a read-write window of a fixed finite size that works on that tape. The first type of restarting automaton was presented at the international conference FCT in 1995. This type was required to restart as soon as it executes a rewrite operation, that is, the window jumps back to the left end of the tape and the finite-state control is reset to the initial state. Moreover, each rewrite operation simply deletes one or more letters from the contents of the read-write window. Subsequently, many different variants of the restarting automaton have been defined and studied. In particular, proper length-reducing rewrite operations have replaced the original delete steps, additional non-input letters, called auxiliary letters, have been added to the alphabet, and the original combined rewrite/restart operation has been split into a rewrite operation and a separate restart operation. Thus, the restarting automaton is no longer just a particular type of automaton, but it has evolved into a whole family of various types of automata that are specified through several parameters. The objective of the current monograph is to collect the many results that have been obtained on the various types of restarting automata in one place and to present them in a uniform and systematic way. In particular, the influence of the various parameters on the expressive capacity of the resulting types of restarting automata is studied in detail. Other topics include the descriptional complexity and inductive inference of certain types of restarting automata, cooperating distributed and parallel communicating systems of restarting automata, restarting automata with output, weighted restarting automata, and restarting automata for picture languages and tree languages. This monograph may serve as a book of reference for researchers working in formal language and automata theory, as a guide to the literature on restarting automata, and as a text book for an advanced undergraduate or graduate course in formal language and automata theory. Dieses Produkt haben wir gerade leider nicht auf Lager.
Du kannst wie immer einen Kaufalarm setzen, wenn du auf das gebrauchte Buch warten möchtest.
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Technische Daten
Erscheinungsdatum
30.10.2025
Sprache
Englisch
EAN
9783031700965
Herausgeber
Springer International Publishing
Serien- oder Bandtitel
Theory and Applications of Computability
Sonderedition
Nein
Autor
Friedrich Otto
Seitenanzahl
409
Einbandart
Broschiert
Buch Untertitel
The Standard Type of Restarting Automaton and Its Variants
Schlagwörter
Reduction analysis, Chomsky hierarchy, Automaton with output, Descriptional complexity, Parallel communicating system
Thema-Inhalt
UYA - Theoretische Informatik
CFX - Computerlinguistik und Korpuslinguistik
Höhe
254 mm
Breite
17.8 cm
Hersteller: Palgrave Macmillan, Europaplatz 3, Heidelberg, Deutschland, 69115, ProductSafety@springernature.com, Springer Nature Customer Service Center GmbH
-.-
★★★★★
☆☆☆☆☆ Leider noch keine Bewertungen
Leider noch keine Bewertungen
Sicher bei rebuy kaufen
Schreib die erste Bewertung für dieses Produkt!
Wenn du eine Bewertung für dieses Produkt schreibst, hilfst du allen Kund:innen, die noch überlegen, ob sie das Produkt kaufen wollen. Vielen Dank, dass du mitmachst!
Sicher bei rebuy kaufen