From post

A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem.

. ISAAC, том 2906 из Lecture Notes in Computer Science, стр. 158-167. Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Molecular clouds in the NGC6334 and NGC6357 region, Evidence for a 100 pc-scale cloud-cloud collision triggering the Galactic mini-starbursts, , , , , , , , , и . (22.06.2017)Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees., и . WADS, том 5664 из Lecture Notes in Computer Science, стр. 554-565. Springer, (2009)Thermal Tactile Presentation Based on Prediction of Contact Temperature., , , , и . J. Robotics Mechatronics, 18 (3): 226-234 (2006)Extraction of characters from color documents., , и . Document Recognition and Retrieval, том 3967 из SPIE Proceedings, стр. 278-285. SPIE, (2000)A new finite automaton construction for regular expressions.. NCMA, том 304 из books@ocg.at, стр. 249-264. Österreichische Computer Gesellschaft, (2014)Optimal Online Bin Packing Algorithms for Some Cases with Two Item Sizes., , , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 106 (9): 1100-1110 (сентября 2023)A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem.. ISAAC, том 2906 из Lecture Notes in Computer Science, стр. 158-167. Springer, (2003)New finite automata corresponding to semiextended regular expressions.. Syst. Comput. Jpn., 36 (10): 54-61 (2005)Application of the stochastic sampling method to various implicit surfaces., , , , и . Comput. Graph., 25 (3): 441-448 (2001)The Huffman Tree Problem with Upper-Bounded Linear Functions., , и . IEICE Trans. Inf. Syst., 105-D (3): 474-480 (2022)