Design interpreters compilers editors (15 résultats)
- Couverture rigide
Vendeur : Daedalus Books, Portland, OR, Etats-UnisDaedalus Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesMembre d’une association professionnelle : CBA
Etat: Occasion - Assez bon
EUR 40,71
EUR 5,71 expéditionExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : Very Good. Etat de la jaquette : No Dust Jacket As Issued. Former owner's name penned to front endpaper. A nice, bright copy. ; 9.6 X 6.5 X 0.8 inches; 214 pages.
- Couverture rigide
- Édition originale
Vendeur : HJP VERSANDBUCHHANDLUNG, WEDEL, SH, AllemagneHJP VERSANDBUCHHANDLUNG
Contacter le vendeurVendeur avec une évaluation de 2 étoilesEtat: Occasion - Assez bon
EUR 27,75
EUR 29,50 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Library Binding. Etat : Good. 1st Edition. 214 p: 72 Fig.
- Couverture rigide
Vendeur : BookHolders, Towson, MD, Etats-UnisBookHolders
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Satisfaisant
EUR 64,54
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Etat : 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.
- Couverture rigide
Vendeur : Anybook.com, Lincoln, Royaume-UniAnybook.com
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Satisfaisant
EUR 93,34
EUR 36,74 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Etat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,550grams, ISBN:3540127895.
- Couverture souple
Vendeur : Ria Christie Collections, Uxbridge, Royaume-UniRia Christie Collections
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 116,77
EUR 14,02 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. In.
- Autres images
- Couverture souple
Vendeur : moluna, Greven, Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 92,27
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New.
- Couverture souple
Vendeur : Books Puddle, New York, NY, Etats-UnisBooks Puddle
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 145,87
EUR 3,51 expéditionExpédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. pp. 232.
- Couverture souple
Vendeur : Revaluation Books, Exeter, Royaume-UniRevaluation Books
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 154,96
EUR 11,70 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 2 disponible(s)
Paperback. Etat : Brand New. reprint edition. 232 pages. 9.60x6.60x0.60 inches. In Stock.
- Autres images
- Couverture souple
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 112,77
EUR 62,05 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : 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 accessi…ble 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.
- Couverture souple
- impression à la demande
Vendeur : Brook Bookstore On Demand, Napoli, NA, ItalieBrook Bookstore On Demand
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 86,24
EUR 5,50 expéditionExpédition depuis Italie vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : new. Questo è un articolo print on demand.
- Couverture souple
- impression à la demande
Vendeur : Basi6 International, Irving, TX, Etats-UnisBasi6 International
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 100,68
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : 10 disponible(s)
Etat : Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service.
- Autres images
- Couverture souple
- impression à la demande
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AllemagneBuchWeltWeit Ludwig Meier e.K.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 112,34
EUR 23,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Taschenbuch. Etat : 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.
- Couverture souple
- impression à la demande
Vendeur : Majestic Books, Hounslow, Royaume-UniMajestic Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 150,66
EUR 7,61 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : 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.
- Couverture souple
- impression à la demande
Vendeur : Biblios, frankfurt am main, HESSE, AllemagneBiblios
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 151,86
EUR 9,95 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. PRINT ON DEMAND pp. 232.
- Autres images
- Couverture souple
- impression à la demande
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 106,99
EUR 60,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : 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 woul…d 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 KG, Sachsenplatz 4-6, 1201 Wien 232 pp. Englisch.
