Articles liés à The Design of Interpreters, Compilers, and Editors...

The Design of Interpreters, Compilers, and Editors for Augmented Transition Networks - Couverture souple

 
9783642821240: The Design of Interpreters, Compilers, and Editors for Augmented Transition Networks

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Acheter neuf

Afficher cet article
EUR 92,27

Autre devise

EUR 9,70 expédition depuis Allemagne vers France

Destinations, frais et délais

Autres éditions populaires du même titre

Résultats de recherche pour The Design of Interpreters, Compilers, and Editors...

Image fournie par le vendeur

Bolc, Leonard
Edité par Springer Berlin Heidelberg, 2011
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Couverture souple

Vendeur : moluna, Greven, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 5071573

Contacter le vendeur

Acheter neuf

EUR 92,27
Autre devise
Frais de port : EUR 9,70
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Leonard Bolc
Edité par Springer Berlin Heidelberg, 2011
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

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 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. N° de réf. du vendeur 9783642821240

Contacter le vendeur

Acheter neuf

EUR 106,99
Autre devise
Frais de port : EUR 10,99
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Edité par Springer, 2011
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. In. N° de réf. du vendeur ria9783642821240_new

Contacter le vendeur

Acheter neuf

EUR 116,77
Autre devise
Frais de port : EUR 4,63
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Leonard Bolc
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Taschenbuch
impression à la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

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 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. N° de réf. du vendeur 9783642821240

Contacter le vendeur

Acheter neuf

EUR 106,99
Autre devise
Frais de port : EUR 15
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Leonard Bolc
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Taschenbuch
impression à la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

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. N° de réf. du vendeur 9783642821240

Contacter le vendeur

Acheter neuf

EUR 112,34
Autre devise
Frais de port : EUR 11
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Edité par Springer, 2011
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Couverture souple

Vendeur : Books Puddle, New York, NY, Etats-Unis

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. pp. 232. N° de réf. du vendeur 2658593299

Contacter le vendeur

Acheter neuf

EUR 130,27
Autre devise
Frais de port : EUR 7,72
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : 4 disponible(s)

Ajouter au panier

Image d'archives

Edité par Springer, 2011
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Couverture souple
impression à la demande

Vendeur : Majestic Books, Hounslow, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

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. N° de réf. du vendeur 50966476

Contacter le vendeur

Acheter neuf

EUR 136,68
Autre devise
Frais de port : EUR 10,28
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 4 disponible(s)

Ajouter au panier

Image d'archives

Bolc Leonard
Edité par Springer, 2011
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Couverture souple
impression à la demande

Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. PRINT ON DEMAND pp. 232. N° de réf. du vendeur 1858593305

Contacter le vendeur

Acheter neuf

EUR 140,15
Autre devise
Frais de port : EUR 7,95
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 4 disponible(s)

Ajouter au panier

Image d'archives

Bolc, Leonard (Editor)
Edité par Springer-Verlag, 2012
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Paperback

Vendeur : Revaluation Books, Exeter, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Paperback. Etat : Brand New. reprint edition. 232 pages. 9.60x6.60x0.60 inches. In Stock. N° de réf. du vendeur x-3642821243

Contacter le vendeur

Acheter neuf

EUR 150,93
Autre devise
Frais de port : EUR 11,61
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Edité par Springer, 2011
ISBN 10 : 3642821243 ISBN 13 : 9783642821240
Neuf Couverture souple

Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur ABLIING23Mar3113020237214

Contacter le vendeur

Acheter neuf

EUR 102,94
Autre devise
Frais de port : EUR 64,37
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier