Implementation and Application of Automata: 26th International Conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022, Proceedings (Lecture Notes in Computer Science)

This book constitutes the proceedings of the 26th International Conference on Implementation and Application of Automata, CIAA 2022, held in Rouen, France in June/ July 2022. The 16 regular papers presented together with 3 invited lectures in this book were carefully reviewed and selected from 26 submissions. The topics of the papers covering various fields in the application, implementation, and theory of automata and related structures. Preface Organization Contents Invited Lectures On 25 Years of CIAA Through the Lens of Data Science 1 Introduction 2 Conference Versus Paper Topics 3 Collaboration Patterns References Manipulation of Regular Expressions Using Derivatives: An Overview 1 Preliminares 2 Derivatives 3 Partial Derivatives 3.1 Position Automaton 4 Complexity of Partial Derivatives 4.1 Complexity of Building APD 5 Beyond Regular Languages References How to Settle the ReDoS Problem: Back to the Classical Automata Theory 1 Introduction 2 Background 2.1 Theoretical Foundations 2.2 ReDoS Problem: Regular Expression Denial-of-Service 2.3 Related Work 3 Proposed Approach 4 Experimental Results and Analysis 4.1 Dataset 4.2 Experiment Settings 4.3 Results and Analysis 5 Conclusions References Conference Papers Ordered Context-Free Grammars 1 Introduction 2 Definitions and Elementary Properties of oCFG 3 oCFG Derivations 4 oCFG Extensions 5 Conclusions and Future Work References Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription 1 Introduction 2 Preliminary Notions 3 SW Visibly Pushdown Automata and Transducers 4 Symbolic Weighted Parsing 5 Properties and Best-Search Algorithm References A Similarity Measure for Formal Languages Based on Convergent Geometric Series 1 Introduction 2 Distance Based on a Convergent Geometric Series 2.1 Formal Languages and Metrics 2.2 Formal Definition of the Distance Metric 2.3 A Comparison with Other Metrics 3 Similarity in Formal Language Exercises 3.1 Automatic Assessment and Grading 3.2 Redistribution of Weights on Short Words 3.3 An Implementation and Test Cases 3.4 Empirical Determination of Good Parameter Values 4 Conclusion References Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata 1 Introduction 2 Preliminaries 3 The Basic Model 4 Constituent Tree Automata References Some Results Concerning Careful Synchronization of Partial Automata and Subset Synchronization of DFA's 1 Introduction 2 Preliminaries 3 Reducing the Number of Letters 4 Constant Number of Letters and Subset Synchronization 5 Conclusions and Further Work References A Toolkit for Parikh Matrices 1 Introduction 2 Preliminaries 3 Toolkit 3.1 Parikh Matrix 3.2 L-Parikh Matrix 3.3 P-Parikh Matrix 3.4 Amiable Words 3.5 L-Amiable Words 3.6 P-Amiable Words 3.7 Is It Parikh? 3.8 Associated Words References Syntax Checking Either Way 1 Introduction 2 Definitions and Preliminaries 3 Syntax Checking Either Way – Could It Make Sense? 4 Decidability – Why We Need Man-Made Proofs 5 Expressive Capacity of DCFLR 6 Closure Properties of RDCFL References On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata 1 Introduction 2 Definitions and Preliminaries 3 Homomorphic Reduction 4 Computational Capacity 5 Decidability Questions References The Cut Operation in Subclasses of Convex Languages (Extended Abstract) 1 Introduction 2 Preliminaries 3 Results 4 Conclusions References Variations of the Separating Words Problem 1 Introduction 2 Preliminaries 3 2-separation and 201-separation 4 -separation 5 Open Problems References Homomorphisms on Graph-Walking Automata 1 Introduction 2 Graph-walking Automata 3 Inverse Homomorphisms: Upper and Lower Bounds 4 A Characterization of Regular Tree Languages 5 Future Work References Nondeterministic State Complexity of Site-Directed Deletion 1 Introduction 2 Preliminaries 3 General Alphabet Site-Directed Deletion 4 Unary Alphabet Site-Directed Deletion 5 Conclusion References Energy Complexity of Regular Language Recognition 1 Introduction 2 The General QFA Framework and Information Erasure 3 Zero-Error QFAs Have No Energy Advantage 4 An Upper Bound for Information Erasure Per Step 5 Trading Energy for Error 6 Concluding Remarks References Real-Time, Constant-Space, Constant-Randomness Verifiers 1 Introduction 2 Preliminaries 2.1 One-Way Multihead Finite Automata 2.2 Verifiers 3 Real-Time, Finite-State, Constant-Randomness Verification 3.1 1DFA@瑥浰搠*@瑥浰挠*2 is Real-Time Verifiable 3.2 Real-Time Verification Beyond 1DFA@瑥浰搠*@瑥浰挠*2 4 Concluding Remarks References Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents 1 Introduction 2 Preliminaries and Some Known Results 3 Monotonic Automata 4 Solvable Automata 5 Synchronizing Automata with Simple Idempotents over a Binary Alphabet 6 Conclusion References An Ambiguity Hierarchy of Weighted Context-Free Grammars 1 Introduction 2 Preliminaries 2.1 Semirings 2.2 Weighted Context-Free Grammars 3 An Extended Ogden's Lemma 4 An Ambiguity Hierarchy of WCFG over Nmin,+ 5 Conclusion References Author Index