The following pages link to Hellis Tamm (Q703503):
Displaying 23 items.
- Bideterministic automata and minimal representations of regular languages (Q703504) (← links)
- On size reduction techniques for multitape automata (Q860868) (← links)
- Design and implementation of a string database query language. (Q1400615) (← links)
- Yet another canonical nondeterministic automaton (Q2112192) (← links)
- Quotients and atoms of reversible languages (Q2139050) (← links)
- Theory of átomata (Q2453119) (← links)
- Quotient Complexities of Atoms of Regular Languages (Q3167483) (← links)
- Minimal DFA for Symmetric Difference NFA (Q3167591) (← links)
- ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA (Q3538856) (← links)
- Bideterministic Automata and Minimal Representations of Regular Languages (Q3559792) (← links)
- Some Minimality Results on Biresidual and Biseparable Automata (Q3564897) (← links)
- New Interpretation and Generalization of the Kameda-Weiner Method. (Q4598258) (← links)
- Theoretical Aspects of Symbolic Automata (Q5127190) (← links)
- Theory of Átomata (Q5199957) (← links)
- On Transition Minimality of Bideterministic Automata (Q5428251) (← links)
- Implementation and Application of Automata (Q5464004) (← links)
- COMPLEXITY OF ATOMS OF REGULAR LANGUAGES (Q5495417) (← links)
- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton (Q5500699) (← links)
- Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002) (← links)
- Implementation and Application of Automata (Q5897686) (← links)
- Boolean Automata and Atoms of Regular Languages (Q6113374) (← links)
- Duality of Lattices Associated to Left and Right Quotients (Q6204124) (← links)
- Yet another canonical nondeterministic automaton (Q6499548) (← links)
