LEADER 04232nam 2200577 a 450 001 9910483617203321 005 20200520144314.0 010 $a3-540-35430-1 024 7 $a10.1007/11779148 035 $a(CKB)1000000000233025 035 $a(SSID)ssj0000317190 035 $a(PQKBManifestationID)11258599 035 $a(PQKBTitleCode)TC0000317190 035 $a(PQKBWorkID)10287399 035 $a(PQKB)11375502 035 $a(DE-He213)978-3-540-35430-7 035 $a(MiAaPQ)EBC3068193 035 $a(PPN)123136032 035 $a(EXLCZ)991000000000233025 100 $a20060510d2006 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in language theory $e10th international conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006 : proceedings /$fOscar H. Ibarra, Zhe Dang (eds.) 205 $a1st ed. 2006. 210 $aBerlin $cSpringer$d2006 215 $a1 online resource (XII, 456 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v4036 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-35428-X 320 $aIncludes bibliographical references and index. 327 $aInvited 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 Gap-Complexity 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 -- P Systems with Proteins on Membranes and Membrane Division -- Computing by Only Observing -- A Decision Procedure for Reflexive Regular Splicing Languages -- Contextual Hypergraph Grammars ? A New Approach to the Generation of Hypergraph Languages -- End-Marked Maximal Depth-First Contextual Grammars -- Some Examples of Semi-rational DAG Languages -- Finding Lower Bounds for Nondeterministic State Complexity Is Hard -- Lowering Undecidability Bounds for Decision Questions in Matrices -- Complexity of Degenerated Three Dimensional Billiard Words -- Factorial Languages of Low Combinatorial Complexity -- Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy -- Language Equations with Complementation -- Synchronizing Automata with a Letter of Deficiency 2 -- On Some Variations of Two-Way Probabilistic Finite Automata Models. 410 0$aLecture notes in computer science ;$v4036. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aDLT 2006 606 $aFormal languages$vCongresses 615 0$aFormal languages 676 $a005.13/1 701 $aIbarra$b Oscar H$01752947 701 $aDang$b Zhe$f1967-$01760619 712 12$aConference on Developments in Language Theory 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483617203321 996 $aDevelopments in language theory$94199667 997 $aUNINA