Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract) - researchr publication

researchr

You are not signed in
Sign in
Sign up

Hermann Gruber, Markus Holzer. Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). In Hing Leung, Giovanni Pighizzini, editors, 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings. pages 267-275, New Mexico State University, Las Cruces, New Mexico, USA, 2006.

Abstract is missing.

runs on WebDSL