Implementing Turing Machines in Dynamic Field Architectures
Independent sets of words and the synchronization problem
Infinite permutations vs. infinite words
Integer Reset Timed Automata: Clock Reduction and Determinizability
Interrupt Timed Automata: verification and expressiveness
Inverse Star, Borders, and Palstars
Isomorphism of regular trees and words
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular
Iterated Hairpin Completions of Non-crossing Words
IUPC: Identification and Unification of Process Constraints