000  04341nam a22005655i 4500  

001  9783540305507  
003  DEHe213  
005  20170515111610.0  
007  cr nn 008mamaa  
008  100702s2005 gw  s  0eng d  
020 
_a9783540305507 _99783540305507 

024  7 
_a10.1007/b103739 _2doi 

050  4  _aQA8.910.3  
072  7 
_aPBC _2bicssc 

072  7 
_aPBCD _2bicssc 

072  7 
_aMAT018000 _2bisacsh 

082  0  4 
_a511.3 _223 
245  1  0 
_aDevelopments in Language Theory _h[electronic resource] : _b8th International Conference, DLT 2004, Auckland, New Zealand, December 1317, 2004. Proceedings / _cedited by Cristian S. Calude, Elena Calude, Michael J. Dinneen. 
264  1 
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005. 

300 
_aXII, 436 p. _bonline resource. 

336 
_atext _btxt _2rdacontent 

337 
_acomputer _bc _2rdamedia 

338 
_aonline resource _bcr _2rdacarrier 

347 
_atext file _bPDF _2rda 

490  1 
_aLecture Notes in Computer Science, _x03029743 ; _v3340 

505  0  _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 TwoDimensional Languages Over OneLetter Alphabet  On Competence in CD Grammar Systems  The DotDepth 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 Biooperations  Avoidable Sets and Well QuasiOrders  A Ciliate Biooperation 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 2Monotone Restarting Automata  On LeftMonotone Deterministic Restarting Automata  On the Computation Power of Finite Automata in TwoDimensional Environments  The Role of the Complementarity Relation in WatsonCrick Automata and Sticker Systems  The Boolean Closure of Linear ContextFree Languages  ContextSensitive Decision Problems in Groups  Decidability and Complexity in Automatic Monoids  Relating Tree Series Transducers and Weighted Tree Automata  An NPComplete 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 EPattern 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.  
650  0  _aMathematics.  
650  0  _aComputers.  
650  0  _aComputer logic.  
650  0  _aMathematical logic.  
650  0 
_aComputer science _xMathematics. 

650  1  4  _aMathematics. 
650  2  4  _aMathematical Logic and Foundations. 
650  2  4  _aMathematical Logic and Formal Languages. 
650  2  4  _aLogics and Meanings of Programs. 
650  2  4  _aComputation by Abstract Devices. 
650  2  4  _aDiscrete Mathematics in Computer Science. 
700  1 
_aCalude, Cristian S. _eeditor. 

700  1 
_aCalude, Elena. _eeditor. 

700  1 
_aDinneen, Michael J. _eeditor. 

710  2  _aSpringerLink (Online service)  
773  0  _tSpringer eBooks  
776  0  8 
_iPrinted edition: _z9783540240143 
830  0 
_aLecture Notes in Computer Science, _x03029743 ; _v3340 

856  4  0  _uhttp://dx.doi.org/10.1007/b103739 
912  _aZDB2SCS  
912  _aZDB2LNC  
942 
_2ddc _cEB 

950  _aComputer Science (Springer11645)  
999 
_c16397 _d16397 