prindi

Lower bound methods for the size of nondeterministic finite automata revisited

autor
Tamm, Hellis
Merwe, Brink van der
vastutusandmed
Hellis Tamm and Brink van der Merwe
allikas
Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017 : proceedings
ilmumiskoht
Cham
kirjastus/väljaandja
Springer International Publishing
ilmumisaasta
2017
leheküljed
p. 261-272
seeria-sari
Lecture notes in computer science ; 10168
leitav
https://doi.org/10.1007/978-3-319-53733-7_19
märksõna
programmeerimiskeeled
ISSN
0302-9743
ISBN
978-3-319-53732-0
märkused
Bibliogr.: 17 ref
TTÜ struktuuriüksus
tarkvarateaduse instituut
keel
inglise
Tamm, H., van der Merwe, B. 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. Cham : Springer International Publishing, 2017. p. 261-272. (Lecture notes in computer science ; 10168). https://doi.org/10.1007/978-3-319-53733-7_19