: Semiring Frameworks and Algorithms for Shortest-Distance Problems.
Henry N. Adorna
: 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata.
: Descriptional Complexity of Finite Automata: Concepts and Open Problems.
: Refining Nondeterminism Below Linear Time.
: Descriptional Complexity of Cellular Automata and Decidability Questions.
: Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview.
: About some Overlap-Free Morphisms on a n-Letter Alphabet.