000 05741nam a22006375i 4500
001 978-3-319-98654-8
003 DE-He213
005 20240730174027.0
007 cr nn 008mamaa
008 180805s2018 sz | s |||| 0|eng d
020 _a9783319986548
_9978-3-319-98654-8
024 7 _a10.1007/978-3-319-98654-8
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aDevelopments in Language Theory
_h[electronic resource] :
_b22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings /
_cedited by Mizuho Hoshi, Shinnosuke Seki.
250 _a1st ed. 2018.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2018.
300 _aXIV, 568 p. 86 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11088
505 0 _aBlock sorting-based transformations on words: beyond the magic BWT -- The Runs Theorem and Beyond -- A Brief Excursion to Parity Games -- A tale of conjunctive grammars -- Groups, languages and dendric shifts -- Some Open Problems in Polyomino Tilings -- Weak Cost Register Automata are Still Powerful -- From Two-Way Transducers to Regular Function Expressions -- Decidability of Right One-Way Jumping Finite Automata -- Additive Number Theory via Approximation by Regular Languages -- Tree-to-graph transductions with scope -- A Characterization of Completely Reachable Automata -- Inequalities for one-step products -- On the commutative equivalence of context-free languages -- Simon's theorem for scattered words -- The Synchronizing Probability Function for Primitive Sets of Matrices -- Recognizability for automata -- Site-Directed Deletion -- Counting Subwords and Regular Languages -- Deque languages, automata and planar graphs -- A General Approach to State Complexity of Operations: Formalization and Limitations -- On Matching Generalised Repetitive Patterns -- Intersection Non-Emptiness and Hardness within Polynomial Time -- Complexity of decision problems on totally rigid acyclic tree grammars -- A Pattern Logic for Automata with Outputs -- The Intersection Problem for Finite Semigroups -- On Completely Reachable Automata and Subset Reachability -- On Minimal Grammar Problems for Finite Languages -- Reversible Pushdown Transducers -- Two-way Automata and One-Tape Machines: Read Only versus Linear Time -- Dynamics of the Independence Number and Automata Synchronization -- Closest Substring Problems for Regular Languages -- Computational Complexity of Decision Problems on Self-Verifying Finite Automata -- Generalizations of Checking Stack Automata: Characterizations and Hierarchies -- On Counting Functions of Languages -- Towards exact state complexity bounds for input-driven pushdown automata -- On Abelian Subshifts -- Reachability Problems in Nondeterministic Polynomial Maps on the Integers -- Projection for Büchi Tree Automata with Constraints between Siblings -- The Computational Power of Parsing Expression Grammars -- On finitely ambiguous Büchi automata -- Uniformization Problem for Variants of First Order Logic over Finite Words -- On deterministic ordered restart-delete automata -- Complementation of Finitely Ambiguous Büchi Automata -- A Structural Lemma for Deterministic Context-Free Languages.
520 _aThis book constitutes the proceedings of the 22nd International Conference on Developments in Language Theory, DLT 2018, held in Tokyo, Japan, in September 2018. The 39 full papers presented in this volume were carefully reviewed and selected from 84 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphics, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional patterns; cryptography; concurrency; celluar automata; bio-inspired computing; quantum computing.
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9110786
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence.
_93407
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer science
_xMathematics.
_93866
650 1 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9110787
650 2 4 _aAlgorithms.
_93390
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aMathematics of Computing.
_931875
700 1 _aHoshi, Mizuho.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9110788
700 1 _aSeki, Shinnosuke.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9110789
710 2 _aSpringerLink (Online service)
_9110790
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319986531
776 0 8 _iPrinted edition:
_z9783319986555
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11088
_9110791
856 4 0 _uhttps://doi.org/10.1007/978-3-319-98654-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c89220
_d89220