(2019). A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"A Non-regular Language of Infinite Trees That Is Recognizable by a Sort-wise Finite Algebra."
Logical Methods in Computer Science 2019.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"A Non-regular Language of Infinite Trees That Is Recognizable by a Sort-wise Finite Algebra."
Logical Methods in Computer Science, 2019.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.