000			04782nam a22005775i 4500
001			978-3-642-14455-4
003			DE-He213
005			20160624102145.0
007			cr nn 008mamaa
008			100814s2010 gw | s |||| 0|eng d
020			_a9783642144554 _9978-3-642-14455-4
024	7		_a10.1007/978-3-642-14455-4 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
245	1	0	_aDevelopments in Language Theory _h[electronic resource] : _b14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings / _cedited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_aXII, 446p. 48 illus. _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, _x0302-9743 ; _v6224
505	0		_aInvited Talks -- Reaction Systems: A Model of Computation Inspired by Biochemistry -- A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages -- The Complexity of Regular(-Like) Expressions -- On Decision Problems for Simple and Parameterized Machines -- DNA Computing and Its Implications for Theoretical Computer Science -- Numeration Systems: A Link between Number Theory and Formal Language Theory -- Regular Papers -- Algorithmic Properties of Millstream Systems -- On a Conjecture by Carpi and D’Alessandro -- Linking Algebraic Observational Equivalence and Bisimulation -- Undecidability and Hierarchy Results for Parallel Communicating Finite Automata -- Inclusion Problems for Patterns with a Bounded Number of Variables -- On the Average Number of States of Partial Derivative Automata -- On the Hybrid ?erný-Road Coloring Problem and Hamiltonian Paths -- Computing Blocker Sets for the Regular Post Embedding Problem -- Rankers over Infinite Words -- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices -- On Müller Context-Free Grammars -- Minimization of Deterministic Bottom-Up Tree Transducers -- Two-Way Unary Automata versus Logarithmic Space -- On the Periodicity of Morphic Words -- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups -- Using Light to Implement Parallel Boolean Algebra -- Periodicity in Tilings -- Complexity in Union-Free Regular Languages -- Schema for Parallel Insertion and Deletion -- On Schützenberger Products of Semirings -- On Language Equations XXK?=?XXL and XM?=?N over a Unary Alphabet -- Around Dot Depth Two -- Input Products for Weighted Extended Top-Down Tree Transducers -- Regular Hedge Language Factorization Revisited -- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm -- On Lexicalized Well-Behaved Restarting Automata That Are Monotone -- On a Powerful Class of Non-universal P Systems with Active Membranes -- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages -- Restricted Ambiguity of Erasing Morphisms -- Automata with Extremal Minimality Conditions -- On the Existence of Minimal ?-Powers -- The Averaging Trick and the ?erný Conjecture -- Short Papers -- Pseudo-power Avoidance -- On Restricted Context-Free Grammars -- Graphs Capturing Alternations in Words -- On the Iterated Hairpin Completion -- On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) -- Joint Topologies for Finite and Infinite Words.
650		0	_aComputer science.
650		0	_aComputer software.
650		0	_aLogic design.
650		0	_aComputational complexity.
650		0	_aArtificial intelligence.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aArtificial Intelligence (incl. Robotics).
700	1		_aGao, Yuan. _eeditor.
700	1		_aLu, Hanlin. _eeditor.
700	1		_aSeki, Shinnosuke. _eeditor.
700	1		_aYu, Sheng. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642144547
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6224
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-14455-4
942			_2EBK9164 _cEBK
999			_c38458 _d38458