Developments in Language Theory

11th International Conference, Dlt 2007, Turku, Finland, July 3-6, 2007, Proceedings

By: Tero Harju (Editor), Juhani Karhum Ki (Editor), Arto Lepist (Editor)

Write A Review

Paperback | 21 June 2007

At a Glance

Paperback
442 Pages

Dimensions(cm)
22.86 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

This book constitutes the refereed proceedings of the 11th International Conference on Developments in Language Theory, DLT 2007, held in Turku, Finland in July 2007. It addresses all important issues in language theory including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; relationships to cryptography, concurrency, complexity theory and logic; bioinspired computing, and quantum computing.

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 $89.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.

You Can Find This Book In

Non-Fiction Language & Linguistics Reference, Dictionaries & Guides Mathematics Mathematical Foundation Mathematical Logic Computing & I.T.Computer Science Computer Architecture & Logic Design Mathematical Theory of Computation Databases Data Capture & Analysis

Computer Programming & Software Development Discrete Mathematics Algebra

On first-order fragments for words and Mazurkiewicz traces	p. 1
Quantitative generalizations of languages	p. 20
What do we know about language equations?	p. 23
Information distance and applications	p. 28
Finite automata and the writing of numbers	p. 29
Descriptional complexity of nondeterministic finite automata	p. 31
From determinism to non-determinism in recognizable two-dimensional languages	p. 36
Coding partitions : regularity, maximality and global ambiguity	p. 48
Multi-letter reversible and quantum finite automata	p. 60
Approximability and non-approximability results in computing the mean speedup of trace monoids	p. 72
The dynamics of cellular automata in shift-invariant topologies	p. 84
Two element unavoidable sets of partial words	p. 90
Hairpin finite automata	p. 108
Characterizing reduction graphs for gene assembly in ciliates	p. 120
2-visibly pushdown automata	p. 132
An efficient computation of the equation K-automaton of a regular K-expression	p. 145
An extension of Newton's method to [omega]-continuous semirings	p. 157
Non-constructive methods for finite probabilistic automata	p. 169
The unambiguity of segmented morphisms	p. 181
Commutation of binary factorial languages	p. 193
Inapproximability of nondeterministic state and transition complexity assuming P [actual symbol not reproducible] NP	p. 205
State complexity of union and intersection of finite languages	p. 217
Bisimulation minimisation for weighted tree automata	p. 229
Conjunctive grammars can generate non-regular unary languages	p. 242
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet	p. 254
Reduced languages as [omega]-generators	p. 266
Avoiding approximate squares	p. 278
Duplication roots	p. 290
Complexity theory for splicing systems	p. 300
Descriptional complexity of bounded context-free languages	p. 312
Definable transductions and weighted logics for texts	p. 324
A star operation for star-free trace languages	p. 337
Finite automata on unranked and unordered DAGs	p. 346
On Almost periodicity criteria for morphic sequences in some particular cases	p. 361
A local balance property of episturmian words	p. 371
Suffix automata and standard sturmian words	p. 382
Fine hierarchy of regular aperiodic [omega]-languages	p. 399
On transition minimality of bideterministic automata	p. 411
Table of Contents provided by Blackwell. All Rights Reserved.

Developments in Language Theory

11th International Conference, Dlt 2007, Turku, Finland, July 3-6, 2007, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Discrete Mathematics

Discrete Mathematics with Applications, Metric Edition

5th edition

Discrete Mathematics for Computing

Grassroots

How to Prove It

A Structured Approach

Weakened Ramsey Theory

Discrete Mathematics and Its Applications

Fuzzy Sets and Triangular Norms

Aggregation in Decision-Aided Intelligent Systems

Handbook of Combinatorial Algebraic Geometry

Subvarieties of the Flag Variety

Robotic Swarming Control via Voronoi Tessellations

Foundations and Applications

Introduction to Automata Theory and Formal Languages

A Logic Building and Problem-solving Approach

The Green Crypto Handbook

Blockchain for Sustainability Professionals

Topics in Mathematical Modeling by Difference Equations

With Mathematica

AK Peters/CRC Recreational Mathematics

60 Years of Mathematical Puzzles in Parabola

The Math Thought Mindset

Logic, Reasoning, and Proofs

A Tour through Graph Theory

Textbooks in Mathematics

A Tour through Graph Theory

Textbooks in Mathematics

Marxian Economics

A New Japanese Tradition

Textbooks in Mathematics

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

Spectra of Signed Graphs

London Mathematical Society Lecture Note Series

Axiomatic Set Theory

An Introduction

Combinatorics and Combinatorial Computing

MCCCC34, Normal, IL, USA, October 21-23, 2022

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Guide to Graph Algorithms

Sequential, Parallel and Distributed

This product is categorised by