Developments in Language Theory
Editat de Cristian S. Calude, Elena Calude, Michael J. Dinneenen Limba Engleză Paperback – 29 noi 2004
Preț: 385.06 lei
Puncte Express: 578
Carte tipărită la comandă
Livrare economică 07-21 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540240143
ISBN-10: 3540240144
Pagini: 448
Ilustrații: XII, 436 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540240144
Pagini: 448
Ilustrații: XII, 436 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited 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 Fragmentof 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.