Regulated Rewriting in Formal Language Theory: 18 (Monographs in Theoretical Computer Science. An EATCS Series, 18) - Image 1

£75.68

Springer Regulated Rewriting in Formal Language Theory: 18 (Monographs in Theoretical Computer Science. An EATCS Series, 18)

Name: Regulated Rewriting in Formal Language Theory: 18 (Monographs in Theoretical Computer Science. An EATCS Series, 18)
Brand: Springer
Price: 75.68 GBP
Availability: InStock

Architecture & Microprocessors

About as cheap as it gets. The only time it was cheaper was 1 year ago.

£76 today · all-time low £73 (Feb 2025) · usually the usual

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 385 days • 385 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 385 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £73 (324 days, 84.2%)

Price range: £73 - £76

Price levels: 2 different prices over 385 days

Description

It is well-known that context-free grammars cannot cover all aspects of natural languages, progamming languages and other related fields. Therefore a lot of mechanisms have been introduced which control the application of context-free rules. This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies. Matrix, programmed, and random context grammars as typical representants are studied in more detail. Besides their algebraic and decidability properties a comparison is made with respect to syntactic complexity measures and pure versions. Further topics are combinations of some control mechanisms, regulated L systems, automata characterizations, Szilard languages, and grammar forms of regulated grammars as well as selective substitution grammars as one common generalization.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3642749348
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 13 December 2011
Listed Since: 13 July 2012

Barcode

No barcode data available

Springer Regulated Rewriting in Formal Language Theory: 18 (Monographs in Theoretical Computer Science. An EATCS Series, 18)

About as cheap as it gets. The only time it was cheaper was 1 year ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Regulated Grammars and Automata

Automata Theory

Formal Languages and Compilation (Texts in Computer Science)

An Introduction to Formal Language Theory (Monographs in Computer Science)

Formal Languages and Computation: Models and Their Applications

Formal Languages and Compilation (Texts in Computer Science)

The Design of Interpreters, Compilers, and Editors for Augmented Transition Networks (Symbolic Computation)

Handbook of Formal Languages: Volume 3 Beyond Words

Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)

Grammars for Language and Genes: Theoretical and Empirical Investigations (Theory and Applications of Natural Language Processing)

Handbook Of Graph Grammars And Computing By Graph Transformation - Volume 2: Applications, Languages And Tools

Grammatical Picture Generation: A Tree-Based Approach (Texts in Theoretical Computer Science. An EATCS Series)

New Developments in Formal Languages and Applications: 113 (Studies in Computational Intelligence, 113)

Finite-State Techniques: Automata, Transducers and Bimachines: 60 (Cambridge Tracts in Theoretical Computer Science, Series Number 60)

Reversible Grammar in Natural Language Processing: 255 (The Springer International Series in Engineering and Computer Science, 255)

Handbook Of Graph Grammars And Computing By Graph Transformation, Vol 1: Foundations: 01

Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words (Networks and Telecommunications)

Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I: 9134 (Lecture Notes in Computer Science, 9134)

Developments in Language Theory: 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings: 12811 (Lecture Notes in Computer Science, 12811)

An Introduction to Formal Languages and Automata

Logic and Language Models for Computer Science: Third Edition

Mathematical Structure of Syntactic Merge: An Algebraic Model for Generative Linguistics (Linguistic Inquiry Monographs)

Springer Automata, Languages and Programming ICALP 2002

Essentials of Functional Grammar: A Structure-Neutral Theory of Movement, Control, and Anaphora: 38 (Trends in Linguistics. Studies and Monographs [TiLSM], 38)