Publisher
Springer International Publishing
Reference51 articles.
1. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. J. Comput. System Sci. 8, 315–332 (1974)
2. Berman, P., Lingas, A.: On the complexity of regular languages in terms of finite automata. Tech. Rep. 304, Polish Academy of Sciences (1977)
3. Birget, J.C.: Partial orders on words, minimal elements of regular languages and state complexity. Theoret. Comput. Sci. 119, 267–291 (1993)
4. Birget, J.C.: Erratum: Partial orders on words, minimal elements of regular languages and state complexity (2002),
http://clam.rutgers.edu/~birget/papers.html
5. Bordihn, H., Holzer, M., Kutrib, M.: Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. 16, 423–440 (2005)