Description
Book Synopsis.- Complementable Normal Form of Parametrized Automata.
.- Toward the Glushkovization of Automata: the Strong Stabilization.
.- Constructing Compact BPE Token DFAs.
.- Epsilon Automata on Linear Orderings.
.- Multi-entry DFA with reduced initial states to speedup parallel recognition.
.- Two-Way Automata and Bounded Languages.
.- An Algebraic Approach to the Equivalence Checking of Deterministic Top-down Tree Transducers.
.- An active learning algorithm for bidirectional deterministic finite automata.
.- Dynamically Weighted Tree Transducers.
.- Engineering an LTLf Synthesis Tool.
.- Subsequence Matching and Analysis Problems for Automata with Translucent Letters.
.- Shape Preserving Tree Transducers.
.- Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata.
.- A New Approach for Showing Termination of Parameterized Transition Systems.
.- An Earley-Based Universal Error-Correcting Parser.
.- More on Language Families with a Decidable Pumping-Problem (Extended Abstract).
.- Self-Verifying Predicates in B¨uchi Arithmetic.
.- State-Freezing Pushdown Automata.
.- From regular expressions to deterministic finite automata: $2ˆ{frac{n}{2}+sqrt{n}(log n)ˆ{Theta(1)}}$ states are necessary and sufficient.
.- A first taste of MeSCaL, a tool for solving membership problems for regular languages.
.- In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages.
.- A hierarchy of reversible finite automata.
