Da: HJP VERSANDBUCHHANDLUNG, WEDEL, SH, Germania
Prima edizione
EUR 27,75
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloLibrary Binding. Condizione: Good. 1st Edition. 214 p: 72 Fig.
Da: Better World Books, Mishawaka, IN, U.S.A.
EUR 45,38
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: Very Good. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.
EUR 40,53
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Very Good. Former owner's name penned to front endpaper. A nice, bright copy. ; 9.6 X 6.5 X 0.8 inches; 214 pages.
Da: BookHolders, Towson, MD, U.S.A.
EUR 61,39
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: Good. [ No Hassle 30 Day Returns ][ Ships Daily ] [ Underlining/Highlighting: NONE ] [ Writing: NONE ] [ Edition: Reprint ] Publisher: Springer-Verlag Pub Date: 8/1/1983 Binding: Hardcover Pages: 214 Reprint edition.
Editore: Springer Berlin Heidelberg, 2011
ISBN 10: 3642821243 ISBN 13: 9783642821240
Lingua: Inglese
Da: moluna, Greven, Germania
EUR 92,27
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Editore: Springer Berlin Heidelberg, 2011
ISBN 10: 3642821243 ISBN 13: 9783642821240
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 106,99
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Augmented Transition Network Grammars are at present the most widely used method for analyzing natural languages. Despite the increasing po pularity of this method, however, no extensive papers on ATN-Grammars have been presented which would be accessible to a larger number of per sons engaged in the problem from both the theoretical and practical points of view. Augmented Transition Networks (ATN) are derived from state automata. Like a finite state automaton, an ATN consists of a collection of la beled states and arcs, a distinguished start state and a set of distin guished final states. States are connected with each other by arcs crea ting a directed graph or net. The label on an arc indicates a terminal symbol (word) or the type of words which must occur in an input stream to allow the transition to the next state. It is said that a sequence of words (or sentence) is accepted by such a net if there exists a se quence of arcs (usually called a path), connecting the start state with a final state, which can be followed to the sentence. The finite state automaton is then enriched by several facilities which increase its computational power. The most important of them permits some arcs to be labeled by nonterminal rather than terminal symbols. This means that the transition through such an arc is actually the re cursive application of the net beginning with a pointed state.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 119,28
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Books Puddle, New York, NY, U.S.A.
EUR 139,22
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 232.
Da: Revaluation Books, Exeter, Regno Unito
EUR 154,49
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. reprint edition. 232 pages. 9.60x6.60x0.60 inches. In Stock.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 104,96
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2011, 2011
ISBN 10: 3642821243 ISBN 13: 9783642821240
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 106,99
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Augmented Transition Network Grammars are at present the most widely used method for analyzing natural languages. Despite the increasing po pularity of this method, however, no extensive papers on ATN-Grammars have been presented which would be accessible to a larger number of per sons engaged in the problem from both the theoretical and practical points of view. Augmented Transition Networks (ATN) are derived from state automata. Like a finite state automaton, an ATN consists of a collection of la beled states and arcs, a distinguished start state and a set of distin guished final states. States are connected with each other by arcs crea ting a directed graph or net. The label on an arc indicates a terminal symbol (word) or the type of words which must occur in an input stream to allow the transition to the next state. It is said that a sequence of words (or sentence) is accepted by such a net if there exists a se quence of arcs (usually called a path), connecting the start state with a final state, which can be followed to the sentence. The finite state automaton is then enriched by several facilities which increase its computational power. The most important of them permits some arcs to be labeled by nonterminal rather than terminal symbols. This means that the transition through such an arc is actually the re cursive application of the net beginning with a pointed state.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 232 pp. Englisch.
Editore: Springer Berlin Heidelberg Dez 2011, 2011
ISBN 10: 3642821243 ISBN 13: 9783642821240
Lingua: Inglese
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 112,34
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Augmented Transition Network Grammars are at present the most widely used method for analyzing natural languages. Despite the increasing po pularity of this method, however, no extensive papers on ATN-Grammars have been presented which would be accessible to a larger number of per sons engaged in the problem from both the theoretical and practical points of view. Augmented Transition Networks (ATN) are derived from state automata. Like a finite state automaton, an ATN consists of a collection of la beled states and arcs, a distinguished start state and a set of distin guished final states. States are connected with each other by arcs crea ting a directed graph or net. The label on an arc indicates a terminal symbol (word) or the type of words which must occur in an input stream to allow the transition to the next state. It is said that a sequence of words (or sentence) is accepted by such a net if there exists a se quence of arcs (usually called a path), connecting the start state with a final state, which can be followed to the sentence. The finite state automaton is then enriched by several facilities which increase its computational power. The most important of them permits some arcs to be labeled by nonterminal rather than terminal symbols. This means that the transition through such an arc is actually the re cursive application of the net beginning with a pointed state. 232 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 142,49
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 232 72 Figures, 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 147,23
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 232.