We define a structurally unambiguous finite automaton (SUFA) to be a nondeterministic finite automaton (NFA) with one starting state q0 such that for all input strings w and for any state q, there is at most one path from q0 to q that consumes w. The definition of SUFA differs from the usual definition of an unambiguous finite automaton (UFA) in that the new definition is defined in terms of th...

Koch et al. (2014) extend longitudinal models of confirmatory factor analysis (CFA) for multitrait-multimethod (MTMM) data (e.g., Geiser and Lockhart, 2012) to accommodate different sorts of methods, that is, structurally different and interchangeable methods. While structurally different methods conform to sampling schemes in which each target (e.g., individual employee) is linked to a unique ...