Pages that link to "Item:Q1034621"

The following pages link to On NFAs where all states are final, initial, or both (Q1034621):

Displaying 19 items.

• Verification of initial-state opacity in security applications of discrete event systems (Q497279) (← links)
• Decision problems for convex languages (Q553302) (← links)
• Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
• On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
• Detectability in stochastic discrete event systems (Q897674) (← links)
• Quotient complexity of closed languages (Q1678754) (← links)
• On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Selective monitoring (Q2221805) (← links)
• Determination of finite automata accepting subregular languages (Q2271457) (← links)
• Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
• State Complexity of Prefix Distance of Subregular Languages (Q2829982) (← links)
• STATE COMPLEXITY OF CODE OPERATORS (Q2909103) (← links)
• THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES (Q2909186) (← links)
• (Q5009434) (← links)
• On finite monoids over nonnegative integer matrices and short killing words (Q5090493) (← links)
• On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond (Q5092447) (← links)
• Comparison of max-plus automata and joint spectral radius of tropical matrices (Q5111233) (← links)
• Simulation by Rounds of Letter-to-Letter Transducers (Q6178697) (← links)