Lower bound methods for the size of nondeterministic finite automata revisited

Tamm, Hellis; van der Merwe, Brink (2017). Lower bound methods for the size of nondeterministic finite automata revisited. Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings. Ed. Drewes, F.; Martín-Vide, C.; Truthe, B. Cham: Springer, 261−272. (Lecture Notes in Computer Science; 10168).10.1007/978-3-319-53733-7_19.
publitseeritud konverentsiettekanne
Tamm, Hellis; van der Merwe, Brink
  • Inglise
Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings
Drewes, F.; Martín-Vide, C.; Truthe, B.
Cham
Springer
0302-9743
978-3-319-53732-0
Lecture Notes in Computer Science
10168
2017
261272
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

doi.org/10.1007/978-3-319-53733-7_19