.-Invited Talks.
.- Automata and Grammars for Data Words.
.- Contributed Papers.
.- Computing the Bandwidth of Meager Timed Automata.
.- Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and other Quadratic Irrationals.
.- PDFA Distillation with Error Bound Guarantees.
.- Constructing a BPE Tokenization DFA.
.- SAT-Based Automated Completion for Reachability Analysis.
.- Non-Emptiness Test for Automata over Words Indexed by the Reals and Rationals.
.- On Bidirectional Deterministic Finite Automata.
.- Block Languages and their Bitmap Representations.
.- From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups.
.- On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract).
.- Global One-Counter Tree Automata.
.- Decision Problems for Subregular Classes.
.- State Complexity of the Minimal Star Basis.
.- On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters.
.- Attributed Tree Transducers for Partial Functions.
.- Translation of Semi-Extended Regular Expressions using Derivatives.
.- Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata.
.- Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata.
.- The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable.
.- Push Complexity: Optimal Bounds and Unary Inputs.
.- Decision Problems for Reversible and Permutation Automata.
.- Benchmarking Regular Expression Matching.
.- On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers.
.- Measuring Power of Commutative Group Languages.
Kostenloser Versand
Bequem zahlen
Wir sind gerne für Sie da