LEADER 05426nam 22007695 450 001 9910483617203321 005 20251226202217.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(BIP)32373177 035 $a(BIP)13523749 035 $a(EXLCZ)991000000000233025 100 $a20100301d2006 u| 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 /$fedited by Oscar H. Ibarra, Zhe Dang 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XII, 456 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4036 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$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 NondeterministicState 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. 330 $aThis book constitutes the refereed proceedings of the 10th International Conference on Developments in Language Theory, DLT 2006, held in Santa Barbara, CA, June 2006. The book presents 36 revised full papers together with 4 invited papers. 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; and more. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4036 606 $aMachine theory 606 $aComputer science 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aFormal Languages and Automata Theory 606 $aTheory of Computation 606 $aComputer Science Logic and Foundations of Programming 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 615 0$aMachine theory. 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aFormal Languages and Automata Theory. 615 24$aTheory of Computation. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 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