Developments in language theory : 10th international conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006 : proceedings / Oscar H. Ibarra, Zhe Dang (eds.).

"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 submi...

Full description

Saved in:
Bibliographic Details
Main Authors: Dang, Zhe, 1967- (Author), Ibarra, Oscar H. (Author)
Corporate Author: Conference on Developments in Language Theory Santa Barbara, Calif.
Format: Ebook
Language:English
Published: Berlin ; New York : Springer, [2006]
Series:Lecture notes in computer science ; 4036.
Subjects:
Online Access:Springer eBooks
Table of contents

MARC

LEADER 00000czm a2200000 i 4500
003 OCoLC
005 20230913143447.0
007 cr mn|||||n|||
008 060630s2006 gw a ob 101 0 eng d
010 |z  2006927282 
011 |a Direct Search Result 
011 |a EDS Title: Developments in Language Theory: 10Th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006 : Proceedings (Lecture notes in computer science, 4036) 
011 |a MARC Score : 10550(21500) : OK 
020 |z 354035428X  |q pbk. 
020 |z 9783540354284  |q pbk. 
035 |a (ATU)b24307804 
035 |a (EDS)EDS283495 
035 |a (OCoLC)262693179 
040 |a OHX  |b eng  |e rda  |c OHX  |d CUS  |d BAKER  |d IQU  |d OKU  |d DLC  |d C$Q  |d YDXCP  |d BTCTA  |d LVB  |d GW5XE  |d OCLCQ  |d E7B  |d OCLCF  |d OCLCO  |d QE2  |d OCL  |d DEBSZ  |d MNU  |d VGM  |d ATU 
042 |a pcc 
050 0 0 |a QA267.3  |b .C63 2006 
082 0 0 |a 005.131  |2 22 
111 2 |a Conference on Developments in Language Theory  |n (10th :  |d 2006 :  |c Santa Barbara, Calif.) 
245 1 0 |a Developments in language theory :  |b 10th international conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006 : proceedings /  |c Oscar H. Ibarra, Zhe Dang (eds.). 
246 3 0 |a DLT 2006 
264 1 |a Berlin ;  |a New York :  |b Springer,  |c [2006] 
264 4 |c ©2006 
300 |a 1 online resource (xii, 456 pages) :  |b illustrations. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Lecture notes in computer science,  |x 0302-9743 ;  |v 4036 
504 |a Includes bibliographical references and index. 
505 0 0 |t Invited Lectures: --  |t Adding Nesting Structure to Words /  |r Rajeev Alur, P. Madhusudan --  |t Can Abstract State Machines Be Useful in Language Theory? /  |r Yuri Gurevich, Charles Wallace --  |t Languages in Membrane Computing: Some Details for Spiking Neural P Systems /  |r Gheorghe Păun --  |t Computational Nature of Biochemical Reactions /  |r A. Ehrenfeucht, G. Rozenberg --  |t Papers: --  |t Polynomials, Fragments of Temporal Logic and the Variety DA over Traces /  |r Manfred Kufleitner --  |t Weighted Automata and Weighted Logics on Infinite Words /  |r Manfred Droste, George Rahonis --  |t Simulation Relations for Alternating Parity Automata and Parity Games /  |r Carsten Fritz, Thomas Wilke --  |t Equivalence of Functions Represented by Simple Context-Free Grammars with Output /  |r Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter --  |t On the Gap-Complexity of Simple RL-Automata /  |r F. Mráz, F. Otto, M. Plátek --  |t Noncanonical LALR(1) Parsing /  |r Sylvain Schmitz --  |t Context-Free Grammars and XML Languages /  |r Alberto Bertoni, Christian Choffrut, Beatrice Palano --  |t Synchronization of Pushdown Automata /  |r Didier Caucal --  |t Context-Dependent Nondeterminism for Pushdown Automata /  |r Martin Kutrib, Andreas Malcher --  |t Prime Decompositions of Regular Languages /  |r Yo-Sub Han, Kai Salomaa, Derick Wood --  |t On Weakly Ambiguous Finite Transducers /  |r Nicolae Santean, Sheng Yu --  |t Ciliate Bio-operations on Finite String Multisets /  |r Jürgen Dassow, György Vaszil --  |t Characterizing DNA Bond Shapes Using Trajectories /  |r Michael Domaratzki --  |t Involution Solid and Join Codes /  |r Nataša Jonoska, Lila Kari, Kalpana Mahalingam --  |t Well-Founded Semantics for Boolean Grammars /  |r Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis --  |t Hierarchies of Tree Series Transformations Revisited /  |r Andreas Maletti --  |t Bag Context Tree Grammars  /  |r Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt --  |t Closure of Language Classes Under Bounded Duplication /  |r Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji --  |t The Boolean Closure of Growing Context-Sensitive Languages /  |r Tomasz Jurdziński --  |t Well Quasi Orders and the Shuffle Closure of Finite Sets /  |r Flavio D’Alessandro, Gwénaël Richomme, Stefano Varricchio --  |t The Growth Ratio of Synchronous Rational Relations Is Unique /  |r Olivier Carton --  |t On Critical Exponents in Fixed Points of Non-erasing Morphisms /  |r Dalia Krieger --  |t P Systems with Proteins on Membranes and Membrane Division /  |r Andrei Păun, Bianca Popa --  |t Computing by Only Observing /  |r Matteo Cavaliere, Pierluigi Frisco, Hendrik Jan Hoogeboom --  |t A Decision Procedure for Reflexive Regular Splicing Languages /  |r Paola Bonizzoni, Giancarlo Mauri --  |t Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages /  |r Adrian-Horia Dediu, Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Benedek Nagy --  |t End-Marked Maximal Depth-First Contextual Grammars /  |r K. Lakshmanan --  |t Some Examples of Semi-rational DAG Languages /  |r Jan Robert Menzel, Lutz Priese, Monika Schuth --  |t Finding Lower Bounds for Nondeterministic State Complexity Is Hard /  |r Hermann Gruber, Markus Holzer --  |t Lowering Undecidability Bounds for Decision Questions in Matrices /  |r Paul Bell, Igor Potapov --  |t Complexity of Degenerated Three Dimensional Billiard Words /  |r J. -P. Borel --  |t Factorial Languages of Low Combinatorial Complexity /  |r Arseny M. Shur --  |t Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy /  |r Christian Glaßer, Stephen Travers, Klaus W. Wagner --  |t Language Equations with Complementation /  |r Alexander Okhotin, Oksana Yakimova --  |t Synchronizing Automata with a Letter of Deficiency 2 /  |r D. S. Ananichev, M. V. Volkov, Yu. I. Zaks --  |t On Some Variations of Two-Way Probabilistic Finite Automata Models /  |r Bala Ravikumar. 
520 |a "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 description and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; bio-inspired computing; and quantum computing."--Publisher description. 
588 |a Machine converted from AACR2 source record. 
650 0 |a Formal languages  |v Congresses  |9 676222 
700 1 |a Dang, Zhe,  |d 1967-  |e author.  |9 422151 
700 1 |a Ibarra, Oscar H.,  |e author.  |9 889094 
776 1 8 |w (OCoLC)70249447  |w (OCoLC)456705309 
830 0 |a Lecture notes in computer science ;  |v 4036.  |x 0302-9743.  |9 291610 
856 4 0 |u https://ezproxy.aut.ac.nz/login?url=https://link.springer.com/10.1007/11779148  |z Springer eBooks  |x TEMPORARY ERM URL 
856 4 1 |3 Table of contents  |u http://catdir.loc.gov/catdir/enhancements/fy1402/2006927282-t.html 
907 |a .b24307804  |b 12-03-21  |c 15-11-17 
942 |c EB 
998 |a none  |b 16-11-17  |c m  |d z   |e -  |f eng  |g gw   |h 0 
999 |c 1430463  |d 1430463 
Availability
Requests
Request this item Request this AUT item so you can pick it up when you're at the library.
Interlibrary Loan With Interlibrary Loan you can request the item from another library. It's a free service.