print

Lower bound methods for the size of nondeterministic finite automata revisited

author
Tamm, Hellis
Merwe, Brink van der
statement of authorship
Hellis Tamm and Brink van der Merwe
source
Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017 : proceedings
location of publication
Cham
publisher
Springer International Publishing
year of publication
2017
pages
p. 261-272
series
Lecture notes in computer science ; 10168
url
https://doi.org/10.1007/978-3-319-53733-7_19
subject term
programmeerimiskeeled
ISSN
0302-9743
ISBN
978-3-319-53732-0
notes
Bibliogr.: 17 ref
TTÜ department
tarkvarateaduse instituut
language
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