Fundamentals of Computation Theory  24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings /  [electronic resource] : 
edited by Henning Fernau, Klaus Jansen. 
 - 1st ed. 2023. 
 - XIII, 438 p. 111 illus., 46 illus. in color.  online resource. 
 - Lecture Notes in Computer Science,  14292  1611-3349 ; .
 - Lecture Notes in Computer Science,  14292 .
<br/><br/>Convergence of distributions on paths -- Subtree Projection for Stepwise Hedge Automata -- The rectilinear convex hull of line segments -- Domino Snake Problems on Groups -- Parsing Unranked Tree Languages, Folded Once -- The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited -- Computing Subset Vertex Covers in H-Free Graphs -- On Computing Optimal Temporal Branchings -- Contracting edges to destroy a pattern: A complexity study -- Distance-based covering problems for graphs of given cyclomatic number -- An efficient computation of the rank function of a positroid -- Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time -- Complexity of Conformant Election Manipulation -- α-β-Factorization and the Binary Case of Simon's Congruence -- Bounds for c-Ideal Hashing -- Parameterized Complexity of $\mathcal_$-Free Edge Deletion Problem -- On the Parallel Complexity of Group Isomorphism via Weisfeiler--Leman -- The Complexity of $(P_k, P_\ell)$-Arrowing -- On Computing a Center Persistence Diagram -- Robust Identification in the Limit from Incomplete Positive Data -- Cordial Forests -- Vertex ordering with precedence constraints -- Forwards- and Backwards-Reachability for Cooperating Multi-Pushdown Systems -- Shortest Dominating Set Reconfiguration under Token Sliding -- Computing Optimal Leaf Roots of Chordal Cographs in Linear Time -- Verified Exact Real Computation with Nondeterministic Functions and Limits -- Exact and Parameterized Algorithms for the Independent Cutset Problem -- Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves -- Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku -- Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. 
<br/><br/> This book constitutes the proceedings of the 24th International Symposium on Fundamentals of Computation Theory, FCT 2023, held in Trier, Germany, in September 2023. The __ full papers included in this volume were carefully reviewed and selected from __ submissions. In addition, the book contains ____ invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods. 
<br/><br/><label>ISBN: </label>9783031435874 
<br/><br/><label>Standard No.: </label>10.1007/978-3-031-43587-4  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.<br/>Data structures (Computer science).<br/>Information theory.<br/>Computer science--Mathematics.<br/>Image processing--Digital techniques.<br/>Computer vision.<br/>Design and Analysis of Algorithms.<br/>Data Structures and Information Theory.<br/>Mathematics of Computing.<br/>Computer Imaging, Vision, Pattern Recognition and Graphics.
<br/><br/><label>LC Class. No.: </label>QA9.58 
<br/><br/><label>Dewey Class. No.: </label>005.13