語(yǔ)言理論進(jìn)展：DLT 2006/會(huì)議錄 Developments in language theory

定　價(jià)：￥678.00

作　者：	Oscar H. Ibarra 著
出版社：	崇文書(shū)局（原湖北辭書(shū)出版社）
叢編項(xiàng)：
標(biāo)　簽：	暫缺

購(gòu)買(mǎi)這本書(shū)可以去

當(dāng)當(dāng)網(wǎng) (￥542.40)

ISBN：	9783540354284	出版時(shí)間：	2006-12-01	包裝：	平裝
開(kāi)本：		頁(yè)數(shù)：		字?jǐn)?shù)：

內(nèi)容簡(jiǎn)介

　　This book constitutes the refereed proceedings of the 10th International Conference on Developments in Language Theory， DLT 2006， held in Santa Barbara， CA， USA in June 2006.The 36 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 63 submissions. All important issues in language theory are addressed including grammars， acceptors and transducers for strings， trees， graphs， arrays; efficient text algorithms; algebraic theories for automata and languages; combinatorial and algebraic properties of words and languages; variable-length codes; symbolic dynamics; decision problems; relations to complexity theory and logic; picture de*ion and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; bio-inspired computing; and quantum computing.

作者簡(jiǎn)介

暫缺《語(yǔ)言理論進(jìn)展：DLT 2006/會(huì)議錄 Developments in language theory》作者簡(jiǎn)介

圖書(shū)目錄

Invited Lectures
　Adding Nesting Structure to Words
　Can Abstract State Machines Be Useful in Language Theory?
　Languages in Membrane Computing: Some Details for Spiking Neural P Systems
　Computational Nature of Biochemical Reactions
Papers
　Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
Weighted Automata and Weighted Logics on Infinite Words
Simulation Relations for Alternating Parity Automata and Parity Games
　Equivalence of Functions Represented by Simple Context-Free Grammars with Output
　On the Gao-Comolexity of Simple RL-Automata
　Noncanonical LALR(1) Parsing
　Context-Free Grammars and XML Languages
　Synchronization of Pushdown Automata
　Context-Dependent Nondeterminism for Pushdown Automata
　Prime Decompositions of Regular Languages
　On Weakly Ambiguous Finite Transducers
　Ciliate Bio-operations on Finite String Multisets
　Characterizing DNA Bond Shapes Using Trajectories
　Involution Solid and Join Codes
　Well-Founded Semantics for Boolean Grammars
　Hierarchies of Tree Series Transformations Revisited
　Bag Context Tree Grammars
　Closure of Language Classes Under Bounded Duplication
　The Boolean Closure of Growing Context-Sensitive Languages
　Well Quasi Orders and the Shuffle Closure of Finite Sets
　The Growth Ratio of Synchronous Rational Relations Is Unique
　On Critical Exponents in Fixed Points of Non-erasing Morphisms
　……
Author Index