Automata, Languages and Programming
Format: Paperback
ISBN13: 9783540083429
Paperback|9783540083429
✨ Featured Offer
Brand New
$53.80
List Price: $49.99
🚚
See all 4 offers from $53.80 FREE standard delivery by: 31 Mar 2026
Overview
How hard is compiler code generation?.- "Natural" complexity measures and time versus memory: Some definitional proposals.- Semantics and proof theory of pascal procedures.- On the structure of combinatorial problems and structure preserving reductions.- Factor graphs, failure functions and Bi-Trees.- Parallel decomposition of LR(k) parsers.- Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata.- Termination tests inside ?-calculus.- On the computational power of reversal-bounded machines.- The contextsensitivity bounds of contextsensitive grammars and languages.- Serial composition of 2-way finite-state transducers and simple programs on strings.- The sequence equivalence problem for dol systems is decidable.- Languages defined by higher type program schemes.- Parsing and syntactic error recovery for context-free grammars by means of coarse structures.- On three types of unambiguity of context-free language.- The mathematics of record handling.- Macro grammars, lindenmayer systems and other copying devices.- On the time and tape complexity of hyper(1)-AFL's.- Renaming and erasing in szilard languages.- Some matching problems.- Complexite des demi -- Groupes de matrices.- On the proper treatment or referencing, dereferencing and assignment.- Complexity of some problems concerning L systems.- Left-fitting translations.- Dynamic binary search.- About the derivation languages of grammars and machines.- Simple chain grammars.- Time-space trade-offs in a pebble game.- Non-deterministic polynomial optimization problems and their approximation.- Simple programs and their decision problems.- Theory of data structures by relational and graph grammars.- On backtracking and greatest fixpoints.- L systems of finite index.- The safety of acoroutine system.- Linear time simulation of multihead turing machines with head -- To-head jumps.- Data types as objects.- On the difference between one and many.- On defining error recovery in context-free parsing.- LL(k) languages are closed under union with finite languages.- The time and tape complexity of developmental languages.- Rational relations of binary trees.- Structural equivalence of context-free grammar forms is decidable.- On the definition of classes of interpretations.
| ISBN-13 | 9783540083429 |
|---|---|
| ISBN-10 | 3540083421 |
| Weight | 1.78 Pounds |
| Dimensions | 6.10 x 1.32 x 9.25 In |
| List Price | $49.99 |
| Edition | 1st Edition |
| Format | Paperback |
|---|---|
| Language | English |
| Pages | xii, 572 pages |
| Publisher | Springer |
| Published On | 1977-07-11 |
View All Offers
Sort by:
Price
Condition
Seller
Seller Comments
Price
✨ Brand New
Seller details
Alibris
Sparks, NV, USA
Print on demand Trade paperback (US). Glued binding. 572 p. Lecture Notes in Computer Science, 52.
Free delivery by: 31 Mar 2026
Brand New
Seller details
GreatBookPrices-
Columbia, MD, USA
100% Money Back Guarantee. Brand New, Perfect Condition. We offer expedited shipping to all US locat...
Free delivery by: 31 Mar 2026
Used, Like New
Seller details
GreatBookPrices-
Columbia, MD, USA
100% Money Back Guarantee. Brand New, Perfect Condition. We offer expedited shipping to all US locat...
Free delivery by: 31 Mar 2026
Used, Good
Seller details
Bonita
Santa Clarita, CA, USA
Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Free delivery by: 31 Mar 2026