• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History

عنوان
The Design of Interpreters, Compilers, and Editors for Augmented Transition Networks

پدید آورنده
edited by Leonard Bloc.

موضوع
Applied linguistics.,Artificial intelligence.,Computer science.

رده
P98
.
E358
1983

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
3642821227
(Number (ISBN
9783642821226

NATIONAL BIBLIOGRAPHY NUMBER

Number
b574265

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
The Design of Interpreters, Compilers, and Editors for Augmented Transition Networks
General Material Designation
[Book]
First Statement of Responsibility
edited by Leonard Bloc.

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
Berlin, Heidelberg
Name of Publisher, Distributor, etc.
Springer Berlin Heidelberg
Date of Publication, Distribution, etc.
1983

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
(XII, 216 pages)

SERIES

Series Title
Artificial Intelligence

CONTENTS NOTE

Text of Note
The Planes Interpreter and Compiler for Augmented Transition Network Grammars --; An ATN Programming Environment --; Compiling Augmented Transition Networks into MacLisp --; Towards the Elastic ATN Implementation.

SUMMARY OR ABSTRACT

Text of Note
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.

TOPICAL NAME USED AS SUBJECT

Applied linguistics.
Artificial intelligence.
Computer science.

LIBRARY OF CONGRESS CLASSIFICATION

Class number
P98
Book number
.
E358
1983

PERSONAL NAME - PRIMARY RESPONSIBILITY

edited by Leonard Bloc.

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

Leonard Bloc

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival