المؤلفون: Joe Sawada, Péter Burcsi, Zsuzsanna Lipták, Gabriele Fici, Frank Ruskey

المساهمون: Burcsi, P., Fici, G., Lipták, Z., Ruskey, F., Sawada, J.

المصدر: Theoretical Computer Science. 659:1-13

مصطلحات موضوعية: FOS: Computer and information sciences, Prefix code, Prefix normal word, Pre-necklace, Discrete Mathematics (cs.DM), General Computer Science, Formal Languages and Automata Theory (cs.FL), Binary number, Computer Science - Formal Languages and Automata Theory, Context (language use), Binary language, Lyndon words, 0102 computer and information sciences, 02 engineering and technology, Prefix grammar, prefix normal forms, Kraft's inequality, Characterization (mathematics), Lyndon word, 01 natural sciences, Prefix normal form, enumeration, Theoretical Computer Science, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Mathematics, Discrete mathematics, prefix normal words, prefix normal forms, binary languages, binary jumbled pattern matching, pre-necklaces, Lyndon words, enumeration, binary jumbled pattern matching, Settore INF/01 - Informatica, Computer Science (all), pre-necklaces, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), prefix normal words, Prefix, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, Combinatorics (math.CO), binary languages, Computer Science::Formal Languages and Automata Theory, Word (group theory), Computer Science - Discrete Mathematics

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b63a01fdf2a63583d6e0de86ed551afc
https://doi.org/10.1016/j.tcs.2016.10.015

المؤلفون: Burcsi, Péter, Fici, Gabriele, Ruskey, Frank, Sawada, Joe, Liptak, Zsuzsanna

المساهمون: Burcsi, Péter, Fici, Gabriele, Liptak, Zsuzsanna, Ruskey, Frank, Sawada, Joe

مصطلحات موضوعية: prefix normal words, prefix normal forms, binary languages, binary jumbled pattern matching, pre-necklaces, Lyndon words, enumeration, psy, lang

Relation: http://hdl.handle.net/11562/953122

الاتاحة: http://hdl.handle.net/11562/953122

المؤلفون: Péter Burcsi, Gabriele Fici, Liptak, Zsuzsanna, Frank Ruskey, Joe Sawada

المساهمون: Péter, Burcsi, Gabriele, Fici, Liptak, Zsuzsanna, Frank, Ruskey, Joe, Sawada

مصطلحات موضوعية: prefix normal word, binary jumbled pattern matching, normal form, enumeration, membership test, binary languages

وصف الملف: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/9783319078892; info:eu-repo/semantics/altIdentifier/wos/WOS:000342753700007; ispartofbook:Proc. of the 7th International Conference on Fun with Algorithms (FUN 2014); 7th International Conference on FUN with Algorithms (FUN 2014); volume:8496; firstpage:74; lastpage:88; numberofpages:15; serie:LECTURE NOTES IN COMPUTER SCIENCE; https://hdl.handle.net/11562/747985; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-84903719416; http://link.springer.com/chapter/10.1007/978-3-319-07890-8_7

الاتاحة: https://hdl.handle.net/11562/747985
https://doi.org/10.1007/978-3-319-07890-8_7
http://link.springer.com/chapter/10.1007/978-3-319-07890-8_7

المؤلفون: Zsuzsanna Lipták, Gabriele Fici, Joe Sawada, Péter Burcsi, Frank Ruskey

المساهمون: Burcsi, P, Fici, G, Lipták, Z, Ruskey, F, Sawada,J

المصدر: Lecture Notes in Computer Science ISBN: 9783319078892
FUN

مصطلحات موضوعية: binary jumbled pattern matching, Efficient algorithm, membership test, Binary number, Context (language use), Prefix Normal Word, Algorithm, Data_CODINGANDINFORMATIONTHEORY, prefix normal words, Omega, Substring, enumeration, Combinatorics, Prefix, normal forms, binary languages, Enumeration, Word (group theory), Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29164fa2692fbe9ac4d4cb9c84170907
http://hdl.handle.net/11562/747985