Some minimality results on biresidual and biseparable automata

Tamm, Hellis (2010). Some minimality results on biresidual and biseparable automata. Language and Automata Theory and Applications : 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010, Proceeding. Ed. Dediu, A.-H.; Fernau, H.; Martín-Vide, C. Berlin: Springer, 573−584. (Lecture Notes in Computer Science; 6031).10.1007/978-3-642-13089-2_48.
publitseeritud konverentsiettekanne
Tamm, Hellis
  • Inglise
Language and Automata Theory and Applications : 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010, Proceeding
Dediu, A.-H.; Fernau, H.; Martín-Vide, C.
Berlin
Springer
0302-9743
978-3-642-13088-5
Lecture Notes in Computer Science
6031
2010
573584
Ilmunud
3.1. Artiklid/peatükid lisas loetletud kirjastuste välja antud kogumikes (kaasa arvatud Thomson Reuters Book Citation Index, Thomson Reuters Conference Proceedings Citation Index, Scopus refereeritud kogumikud)

Viited terviktekstile

dx.doi.org/10.1007/978-3-642-13089-2_48