Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Nabais, D"'
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1406::31aac8372e63de6a2936aa9dc1b5b348
https://hdl.handle.net/10216/90548
https://hdl.handle.net/10216/90548
