LEADER 04234nam a22005775i 4500
001 809262
003 TR_AnAIT
005 20260131023642
007 cr nn 008mamaa
008 121227s1983 gw | s |||| 0|eng d
020 |a9783642821226|9978-3-642-82122-6
024 7 |a10.1007/978-3-642-82122-6|2doi
041 |aeng
049 |aTürk Tarih Kurumu Kütüphanesi
050 4|aP129-138.7222
072 7|aCF|2bicssc
072 7|aLAN009000|2bisacsh
072 7|aCF|2thema
082 04|a418|223
090 |aDK/10551
245 14|aThe Design of Interpreters, Compilers, and Editors for Augmented Transition Networks|h[electronic resource] /|cedited by Leonard Bolc.
250 |a1st ed. 1983.
264 1|aBerlin, Heidelberg :|bSpringer Berlin Heidelberg :|bImprint: Springer,|c1983.
300 |aXII, 216 p.|bonline resource.
336 |atext|btxt|2rdacontent
337 |acomputer|bc|2rdamedia
338 |aonline resource|bcr|2rdacarrier
347 |atext file|bPDF|2rda
490 1 |aArtificial Intelligence
505 0 |aThe Planes Interpreter and Compiler for Augmented Transition Network Grammars -- An ATN Programming Environment -- Compiling Augmented Transition Networks into MacLisp -- Towards the Elastic ATN Implementation.
520 |aAugmented 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.
532 8 |aAccessibility summary: This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.
532 8 |aInaccessible, or known limited accessibility
532 8 |aNo reading system accessibility options actively disabled
532 8 |aPublisher contact for further accessibility information: accessibilitysupport@springernature.com
650 0|aApplied linguistics.
650 0|aCompilers (Computer programs).
650 0|aArtificial intelligence.
650 14|aApplied Linguistics.
650 24|aCompilers and Interpreters.
650 24|aArtificial Intelligence.
700 1 |aBolc, Leonard.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
710 2 |aSpringerLink (Online service)
773 0 |tSpringer Nature eBook
776 08|iPrinted edition:|z9783540127895
776 08|iPrinted edition:|z9783642821233
776 08|iPrinted edition:|z9783642821240
830 0|aArtificial Intelligence
856 40|uhttps://doi.org/10.1007/978-3-642-82122-6
912 |aZDB-2-SHU
912 |aZDB-2-SXS
912 |aZDB-2-BAE
950 |aHumanities, Social Sciences and Law (SpringerNature-11648)
950 |aSocial Sciences (R0) (SpringerNature-43726)