• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History
  • ورود / ثبت نام

عنوان
Automata, Languages and Programming :

پدید آورنده
edited by Hermann A. Maurer.

موضوع
Information theory.,Software engineering.,Theory of Computation.

رده

کتابخانه
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
354035168X
(Number (ISBN
9783540351689

NATIONAL BIBLIOGRAPHY NUMBER

Number
b565753

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Automata, Languages and Programming :
General Material Designation
[Book]
Other Title Information
Sixth Colloquium, Graz, Austria, July 16-20, 1979
First Statement of Responsibility
edited by Hermann A. Maurer.

.PUBLICATION, DISTRIBUTION, ETC

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

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
(XII, 688 p.).

SERIES

Series Title
Lecture notes in computer science, 71.

GENERAL NOTES

Text of Note
Bibliographic Level Mode of Issuance: Monograph.

CONTENTS NOTE

Text of Note
Sharing in nondeterminism --; Sur les mots sans carré définis par un morphisme --; A characterization of abstract data as model-theoretic invariants --; Inherent ambiguities in families of grammars extended abstract --; Representing complexity classes by equality sets --; Supercounter machines --; Existential quantifiers in abstract data types --; A generalization of Ginsburg and Rose's characterization of G-S-M mappings --; Strict deterministic languages and controlled rewriting systems --; A string matching algorithm fast on the average --; Functional characterization of some semantic equalities inside ?-calculus --; Arbitration and queueing under limited shared storage requirements --; On the homomorphic characterizations of families of languages --; Two level grammars: CF-grammars with equation schemes --; Proving termination with multiset orderings --; One abstract accepting algorithm for all kinds of parsers --; Studies in abstract/concrete mappings in proving algorithm correctness --; A characterization of a dot-depth two analogue of generalized definite languages --; Partitioned LL(k) grammars --; Recursion schemes and generalized interpretations --; A rational theory of AFLs --; On the succinctness of different representations of languages --; A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs --; Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons --; A unique termination theorem for a theory with generalised commutative axioms --; Dags and Chomsky hierarchy --; Recent advances in the probabilistic analysis of graph-theoretic algorithms --; On the average stack size of regularly distributed binary trees --; On reductions of parallel programs --; On the height of derivation trees --; The modal logic of programs --; A comparison between two variations of a pebble game on graphs --; LL(k) parsing for attributed grammars --; On eliminating nondeterminism from Turing machines which use less than logarithm worktape space --; Structure preserving transformations on non-left-recursive grammars --; The complexity of restricted minimum spanning tree problems --; A systematic approach to formal language theory through parallel rewriting --; Extending the notion of finite index --; On the complexity of general context-free language parsing and recognition --; Space-time tradeoffs for oblivious integer multiplication --; Investigating programs in terms of partial graphs --; On the power of random access machines --; An axiomatic treatment of ALGOL 68 routines --; P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP --; Constructing call-by-value continuation semantics --; A formal semantics for concurrent systems --; On constructing LL(k) parsers --; More on advice on structuring compilers and proving them correct --; Languages of nilpotent and solvable groups (extended abstract) --; Unique fixed points vs. least fixed points --; A modification of the LR(k) method for constructing compact bottom-up parsers --; Optimal decomposition of linear automata --; Bracketed two-level grammars - A decidable and practical approach to language definitions.

TOPICAL NAME USED AS SUBJECT

Information theory.
Software engineering.
Theory of Computation.

PERSONAL NAME - PRIMARY RESPONSIBILITY

edited by Hermann A. Maurer.

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

Hermann A Maurer

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