Descriptional Complexity of Formal Systems

.- Invited Talks.

.- The Power and Limits of Population Protocols.
.- Formal Language Theory and Transformers.
.- Representing Concepts with Small Teaching Sets.

.- Contributed Papers.

.- 2-word-π-representable Graphs.
.- Largest Finite Optimal Existential and Universal Widths of unary AFAs.
.- On the Average State Complexity of Shuffle Ideals.
.- Quantifying Distance From Simplicity.
.- Some Descriptional Complexity Results for Context-Conditional Grammars.
.- Exact Accepting-State Spectrum for Reversal of Permutation Automata.
.- A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata.
.- The Boundary of Closed and Ideal Languages.
.- State-Limited Inductive Inference of Cellular Automata.
.- Bounds on the number of θ-palindromes in θ-conjugates.
.- State Complexity of Shifts of the Fibonacci Word.
.- On the Complexity of Multi-entry DFAs.
.- Determinizing k-path input-driven PDAs.