000 04318nam a22005895i 4500
001 978-3-319-40946-7
003 DE-He213
005 20200421111649.0
007 cr nn 008mamaa
008 160705s2016 gw | s |||| 0|eng d
020 _a9783319409467
_9978-3-319-40946-7
024 7 _a10.1007/978-3-319-40946-7
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aImplementation and Application of Automata
_h[electronic resource] :
_b21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings /
_cedited by Yo-Sub Han, Kai Salomaa.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXVI, 335 p. 91 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 ;
_v9705
505 0 _aDecision Problems for Finite Automata over Infinite Algebraic Structures -- The Degree of Irreversibility in Deterministic Finite Automata -- Deterministic Stack Transducers -- Computing the Expected Edit Distance from a String to a PFA -- Derived-Term Automata of Multitape Rational Expressions -- Solving Parity Games Using an Automata-Based Algorithm -- Ternary Equational Languages -- Problems on Finite Automata and the Exponential Time Hypothesis -- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata -- A Practical Simulation Result for Two-Way Pushdown Automata -- Nondeterministic Complexity of Operations on Closed and Ideal Languages -- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L -- Kuratowski Algebras Generated by Prefix-Free Languages -- A Logical Characterization of Small 2NFAs -- Experiments with Synchronizing Automata -- Implementation of Code Properties via Transducers -- On Synchronizing Automata and Uniform Distribution -- Looking for the Pairs that are Hard to Separate: A Quantum Approach -- Prefix Distance Between Regular Languages -- Complexity of Sets of Two-Dimensional Patterns -- The Complexity of Fixed-Height Patterned Tile Self-Assembly -- Derivative-Based Diagnosis of Regular Expression Ambiguity -- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages -- Derivatives for Enhanced Regular Expressions -- Weighted Restarting Automata as Language Acceptors -- Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy -- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA.
520 _aThis book constitutes the refereed proceedings of the 21st International Conference on Implementation and Application of Automata, CIAA 2016, held in Seoul, South Korea, in July 2016. The 26 revised full papers presented were carefully reviewed and selected from 49 submissions. The papers cover a wide range of topics including characterizations of automata, computing distances between strings and languages, implementations of automata and experiments, enhanced regular expressions, and complexity analysis. .
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Structures.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aHan, Yo-Sub.
_eeditor.
700 1 _aSalomaa, Kai.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319409450
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9705
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-40946-7
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c54308
_d54308