Lecture Notes in Computer Science

7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings

By: ZoltÃ¡n Ã?sik (Editor), ZoltÃ¡n FÃ¼lÃ¶p (Editor)

Write A Review

Paperback | 20 June 2003

At a Glance

Paperback
456 Pages

Dimensions(cm)
24.77 x 15.24 x 2.54

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

The refereed proceedings of the 7th International Conference on Developments in Language Theory, DLT 2003, held in Szeged, Hungary, in July 2003.

The 27 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 57 submissions. All current aspects in language theory are addressed, in particular grammars, acceptors, and transducers for strings, trees, graphs, arrays, etc; algebraic theories for automata and languages; combinatorial properties of words and languages; formal power series; decision problems; efficient algorithms for automata and languages; and relations to complexity theory and logic, picture description and analysis, DNA computing, quantum computing, cryptography, and concurrency.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $0.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

Quantum Computing: 1-Way Quantum Automata	p. 1
An Automata-Theoretic Approach to Software Verification	p. 21
Comments on Complete Sets of Tree Automata	p. 22
On a Conjecture of Schnoebelen	p. 35
Restarting Automata and Their Relations to the Chomsky Hierarchy	p. 55
Test Sets for Large Families of Languages	p. 75
Complexity Theory Made Easy	p. 95
Synchronizing Monotonic Automata	p. 111
Covering Problems from a Formal Language Point of View	p. 122
Regular Languages Generated by Reflexive Finite Splicing Systems	p. 134
The Myhill-Nerode Theorem for Recognizable Tree Series	p. 146
Generating Series of the Trace Group	p. 159
Residual Finite Tree Automata	p. 171
From Glushkov WFAs to Rational Expressions	p. 183
NFA Reduction Algorithms by Means of Regular Inequalities	p. 191
Tile Rewriting Grammars	p. 206
Distributed Pushdown Automata Systems: Computational Power	p. 218
On Well Quasi-orders on Languages	p. 230
Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models	p. 242
On Enumeration of Muller Automata	p. 254
Branching Grammars: A Generalization of ET0L Systems	p. 266
Learning a Regular Tree Language from a Teacher	p. 279
On Three Classes of Automata-Like P Systems	p. 292
Computing Languages by (Bounded) Local Sets	p. 304
About Duval's Conjecture	p. 316
Computation with Absolutely No Space Overhead	p. 325
Deleting String Rewriting Systems Preserve Regularity	p. 337
On Deterministic Finite Automata and Syntactic Monoid Size, Continued	p. 349
Flip-Pushdown Automata Nondeterminism is Better than Determinism	p. 361
Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton	p. 373
Minimizing Finite Automata Is Computationally Hard	p. 386
Boolean Grammars	p. 398
Syntactic Semiring and Universal Automaton	p. 411
Alphabetic Pushdown Tree Transducers	p. 423
Author Index	p. 437
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Discrete Mathematics

How to Prove It

A Structured Approach

Discrete Mathematics for Computing

Grassroots

Marxian Economics

A New Japanese Tradition

Weakened Ramsey Theory

Discrete Mathematics and Its Applications

Fuzzy Sets and Triangular Norms

Aggregation in Decision-Aided Intelligent Systems

The Green Crypto Handbook

Blockchain for Sustainability Professionals

Topics in Mathematical Modeling by Difference Equations

With Mathematica

Reading Randomness I

New Horizons for Understanding Fractal and Fractional Calculus

Parabolic Problems

60 Years of Mathematical Puzzles in Parabola

Automatic Generation Of Algorithms

Advances in Metaheuristics

Federated Learning for Smart Communication using IoT Application

Chapman & Hall/CRC Cyber-Physical Systems

Lights and Shadows on Generalizations in Fixed Point Theory

Business Process Analytics

Modeling, Simulation and Design

Introduction to Mathematical Logic

Discrete Mathematics and Its Applications

Introduction to Modern Cryptography

Revised Third Edition

Discrete Mathematics and Its Applications

2025 Release ISE

Discrete Choice Models

Mathematical Methods, Econometrics, and Data Science

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Geometry of Frameworks

Compact Textbooks in Mathematics

Universal Key: Fourier Transformation Innovative

Applications in Science and Technology

Quantum Communication and Cryptography

Combinatorial Algorithms

37th International Workshop, IWOCA 2026, Clermont-Ferrand, France, June 8-11, 2026, Proceedings

New Probes into Discrete and Convex Geometry

Bolyai Society Mathematical Studies

An Introduction to Single-User Information Theory

Springer Undergraduate Texts in Mathematics and Technology

This product is categorised by