Design Interpreters Compilers Editors (15 results)
- Hardcover
Seller: Daedalus Books, Portland, OR, U.S.A.Daedalus Books
Contact seller4-star sellerAssociation member: CBA
Condition: Used - Very good
£ 34.33
£ 4.82 shippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: Very Good. Dust Jacket Condition: 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.
- Hardcover
- First Edition
Seller: HJP VERSANDBUCHHANDLUNG, WEDEL, SH, GermanyHJP VERSANDBUCHHANDLUNG
Contact seller2-star sellerCondition: Used - Very good
£ 24.48
£ 25.27 shippingShips from Germany to U.S.A.Quantity: 1 available
Library Binding. Condition: Good. 1st Edition. 214 p: 72 Fig.
- Hardcover
Seller: BookHolders, Towson, MD, U.S.A.BookHolders
Contact seller5-star sellerCondition: Used - Good
£ 54.43
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: 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.
- Softcover
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
£ 84.36
Free ShippingShips within U.S.A.Quantity: 10 available
Condition: Brand New. New. Delivery takes 25-30 days. Excellent Customer Service.
- Hardcover
Seller: Anybook.com, Lincoln, United KingdomAnybook.com
Contact seller5-star sellerCondition: Used - Good
£ 77.45
£ 31.40 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: 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.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 96.88
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 81.42
£ 41.97 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 123.03
£ 2.96 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 232.
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 126.96
£ 10.00 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. reprint edition. 232 pages. 9.60x6.60x0.60 inches. In Stock.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 99.50
£ 53.16 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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 acc…essible 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.
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller5-star sellerCondition: New
£ 76.10
£ 4.71 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 99.13
£ 19.70 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: 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 wh…ich 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.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 127.07
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: 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.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 134.00
£ 8.52 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. 232.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 94.41
£ 51.40 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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 KG, Sachsenplatz 4-6, 1201 Wien 232 pp. Englisch.
