The following pages link to STACS 2005 (Q5710693):
Displaying 9 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Backward and forward bisimulation minimization of tree automata (Q840778) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- On the average state and transition complexity of finite languages (Q2465048) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata (Q3303912) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Transition Function Complexity of Finite Automata (Q5200100) (← links)