Complexity metric and structural measure on the class of non deterministic matrices

MaRDI QIDQ3633751zbMATH OpenFDO

Authors M. Maria Susai Manuel, G. Britto Antony Xavier, L. Ravi

Publication date 23 June 2009

zbMATH Keywords

complexity metricnon-deterministic digraphnon-deterministic matrixnon-deterministic finite automaton

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57)

Recommendations

• Complexity metric and structural measure on the class of deterministic matrices
• Comparisons between measures of nondeterminism on finite automata
• Ambiguity, nondeterminism and state complexity of finite automata
• Counting nondeterministic computations
• On the degree of ambiguity of finite automata

Cited in

(5)

• Complexity metric and structural measure on the class of deterministic matrices
• Identifying complexity by means of matrices
• Undirected determinant and its complexity
• Complexity measures of sign matrices
• On the Complexity of Computing Two Nonlinearity Measures

This page was built for publication: Complexity metric and structural measure on the class of non deterministic matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633751)