The following pages link to Theory of átomata (Q2453119):
Displaying 26 items.
- Syntactic complexity of regular ideals (Q722210) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Yet another canonical nondeterministic automaton (Q2112192) (← links)
- Quotients and atoms of reversible languages (Q2139050) (← links)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- Syntactic complexity of bifix-free regular languages (Q2319913) (← links)
- DFA minimization: double reversal versus split minimization algorithms (Q2342683) (← links)
- Syntactic complexity of bifix-free languages (Q2399256) (← links)
- Complexity of suffix-free regular languages (Q2402364) (← links)
- Unrestricted State Complexity of Binary Operations on Regular Languages (Q2829970) (← links)
- Complexity of Suffix-Free Regular Languages (Q2947876) (← links)
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata (Q3303912) (← links)
- A Congruence-Based Perspective on Finite Tree Automata (Q5025071) (← links)
- (Q5089207) (← links)
- A congruence-based perspective on automata minimization algorithms (Q5092441) (← links)
- (Q5155681) (← links)
- Most Complex Non-Returning Regular Languages (Q5205037) (← links)
- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton (Q5500699) (← links)
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (Q5738995) (← links)
- Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002) (← links)
- Complexity of proper prefix-convex regular languages (Q5919576) (← links)
- Complexity of bifix-free regular languages (Q5919577) (← links)
- Complexity of proper prefix-convex regular languages (Q5920052) (← links)
- Complexity of bifix-free regular languages (Q5920053) (← links)
- Duality of Lattices Associated to Left and Right Quotients (Q6204124) (← links)
- Yet another canonical nondeterministic automaton (Q6499548) (← links)
