Zobrazeno 1 - 2
of 2
pro vyhledávání: '"2012 ACM Subject Classification Theory of computation → Tree languages"'
Autor:
Colcombet, Thomas, Jaquard, Arthur
Publikováno v:
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Aug 2022, Vienna, Austria. pp.1868-8969, ⟨10.4230/LIPIcs.MFCS.2022.37⟩
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Aug 2022, Vienna, Austria. pp.1868-8969, ⟨10.4230/LIPIcs.MFCS.2022.37⟩
In this paper, we consider infinitely sorted tree algebras recognising regular language of finite trees. We pursue their analysis under the angle of their asymptotic complexity, i.e. the asymptotic size of the sorts as a function of the number of var
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d54cdec7fbb609a85a0854b85bb0be6f
Autor:
Colcombet, Thomas, Jaquard, Arthur
Publikováno v:
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.127⟩
Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
International Colloquium on Automata, Languages, and Programming, ICALP
International Colloquium on Automata, Languages, and Programming, ICALP, 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.127⟩
International Colloquium on Automata, Languages, and Programming, ICALP, 2021, Glasgow, United Kingdom. pp.123:1-123:14, ⟨10.4230/LIPIcs.ICALP.2021.127⟩
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.127⟩
Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
International Colloquium on Automata, Languages, and Programming, ICALP
International Colloquium on Automata, Languages, and Programming, ICALP, 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.127⟩
International Colloquium on Automata, Languages, and Programming, ICALP, 2021, Glasgow, United Kingdom. pp.123:1-123:14, ⟨10.4230/LIPIcs.ICALP.2021.127⟩
In this paper, we initiate a study of the expressive power of tree algebras, and more generally infinitely sorted algebras, based on their asymptotic complexity. We provide a characterization of the expressiveness of tree algebras of bounded complexi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73ef028cc856e8bb3f88d5502b43afd5
https://hal.archives-ouvertes.fr/hal-03468263/document
https://hal.archives-ouvertes.fr/hal-03468263/document