LEADER 04186nam 2200565 a 450 001 9910484260603321 005 20200520144314.0 010 $a3-540-30550-5 024 7 $a10.1007/b103739 035 $a(CKB)1000000000212641 035 $a(SSID)ssj0000138104 035 $a(PQKBManifestationID)11148253 035 $a(PQKBTitleCode)TC0000138104 035 $a(PQKBWorkID)10096925 035 $a(PQKB)11753403 035 $a(DE-He213)978-3-540-30550-7 035 $a(MiAaPQ)EBC3068279 035 $a(PPN)134123506 035 $a(EXLCZ)991000000000212641 100 $a20041110d2004 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in language theory $e8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004 : proceedings /$f[Cristian S. Calude, Elena Calude, Michael J. Dinneen (eds.)] 205 $a1st ed. 2005. 210 $aBerlin ;$aNew York $cSpringer$dc2004 215 $a1 online resource (XII, 436 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3340 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-24014-4 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey -- Some New Directions and Questions in Parameterized Complexity -- Basic Notions of Reaction Systems -- A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms -- Algebraic and Topological Models for DNA Recombinant Processes -- Contributed Papers -- Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet -- On Competence in CD Grammar Systems -- The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels -- Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages -- On the Maximum Coefficients of Rational Formal Series in Commuting Variables -- On Codes Defined by Bio-operations -- Avoidable Sets and Well Quasi-Orders -- A Ciliate Bio-operation and Language Families -- Semantic Shuffle on and Deletion Along Trajectories -- Sturmian Graphs and a Conjecture of Moser -- P Systems Working in the Sequential Mode on Arrays and Strings -- Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings -- The Power of Maximal Parallelism in P Systems -- An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars -- On the Complexity of 2-Monotone Restarting Automata -- On Left-Monotone Deterministic Restarting Automata -- On the Computation Power of Finite Automata in Two-Dimensional Environments -- The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems -- The Boolean Closure of Linear Context-Free Languages -- Context-Sensitive Decision Problems in Groups -- Decidability and Complexity in Automatic Monoids -- Relating Tree Series Transducers and Weighted Tree Automata -- An NP-Complete Fragment of LTL -- From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata -- Words Avoiding -Powers and the Thue?Morse Morphism -- On the Equivalence Problem for E-Pattern Languages Over Small Alphabets -- Complementation of Rational Sets on Countable Scattered Linear Orderings -- On the Hausdorff Measure of ?-Power Languages -- A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages -- Tissue P Systems with Minimal Symport/Antiport. 410 0$aLecture notes in computer science ;$v3340. 517 3 $aDLT 2004 606 $aFormal languages$vCongresses 615 0$aFormal languages 676 $a005.13/1 701 $aCalude$b Cristian$f1952-$0286700 701 $aCalude$b Elena$01755850 701 $aDinneen$b M. J.$f1957-$01755851 712 12$aConference on Developments in Language Theory 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484260603321 996 $aDevelopments in language theory$94192820 997 $aUNINA