Implementation and Application of Automata

<div>Decision Problems for Finite Automata over Infinite Algebraic Structures.-&nbsp;The Degree of Irreversibility in Deterministic Finite Automata.-&nbsp;Deterministic Stack Transducers.-&nbsp;Computing the Expected Edit Distance from a String to a PFA.-&nbsp;</div><div>Derived-Term Automata of Multitape Rational Expressions.-&nbsp;Solving Parity Games Using an Automata-Based Algorithm.-&nbsp;Ternary Equational Languages.-&nbsp;Problems on Finite Automata and the Exponential Time Hypothesis.-&nbsp;A Practical Algorithm for the Uniform Membership Problem of Labeled&nbsp;Multidigraphs of Tree-Width 2 for Spanning Tree Automata.-&nbsp;A Practical Simulation Result for Two-Way Pushdown Automata.-&nbsp;Nondeterministic Complexity of Operations on Closed and Ideal Languages.-&nbsp;On Bounded Semilinear Languages, Counter Machines, and&nbsp;Finite-Index ET0L.-&nbsp;Kuratowski Algebras Generated by Prefix-Free Languages.-&nbsp;A Logical Characterization of Small 2NFAs.-&nbsp;Experiments with Synchronizing Automata.-&nbsp;</div><div>Implementation of Code Properties via Transducers.-&nbsp;On Synchronizing Automata and Uniform Distribution.-&nbsp;Looking for the Pairs that are Hard to Separate: A Quantum Approach.-&nbsp;Prefix Distance Between Regular Languages.-&nbsp;Complexity of Sets of Two-Dimensional Patterns.-&nbsp;The Complexity of Fixed-Height Patterned Tile Self-Assembly.-&nbsp;Derivative-Based Diagnosis of Regular Expression Ambiguity.-&nbsp;Regular Approximation of Weighted Linear Nondeleting Context-Free&nbsp;Tree Languages.-&nbsp;</div><div>Derivatives for Enhanced Regular Expressions.-&nbsp;Weighted Restarting Automata as Language Acceptors.-&nbsp;Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy.-&nbsp;Analyzing Matching Time Behavior of Backtracking Regular Expression</div><div>Matchers by Using Ambiguity of NFA.</div>