The Experts below are selected from a list of 153 Experts worldwide ranked by ideXlab platform
Loris Dantoni - One of the best experts on this subject based on the ideXlab platform.
-
streaming tree transducers
Journal of the ACM, 2017Co-Authors: Rajeev Alu, Loris DantoniAbstract:The theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees (and forests) in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack, and a finite number of variables that store output chunks that can be combined using the operations of String-Concatenation and tree-insertion. We prove that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO). Existing models of tree transducers either cannot implement all MSO-definable transformations, or require regular look-ahead that prohibits single-pass implementation. We show a variety of analysis problems such as type-checking and checking functional equivalence are decidable for our model.
-
streaming tree transducers
International Colloquium on Automata Languages and Programming, 2012Co-Authors: Rajeev Alu, Loris DantoniAbstract:Theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees (and hedges) in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output using a finite-state control, a visibly pushdown stack, and a finite number of variables that store output chunks that can be combined using the operations of String-Concatenation and tree-insertion. We prove that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO). We establish complexity upper bounds of ExpTime for type-checking and NExpTime for checking functional equivalence for our model. We consider variations of the basic model when inputs/outputs are restricted to Strings and ranked trees, and in particular, present the model of bottom-up ranked-tree transducers, which is the first known MSO-equivalent transducer model that processes trees in a bottom-up manner.
-
streaming tree transducers
arXiv: Formal Languages and Automata Theory, 2011Co-Authors: Rajeev Alu, Loris DantoniAbstract:Theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack, and a finite number of variables that store output chunks that can be combined using the operations of String-Concatenation and tree-insertion. We prove that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO). Existing models of tree transducers either cannot implement all MSO-definable transformations, or require regular look ahead that prohibits single-pass implementation. We show a variety of analysis problems such as type-checking and checking functional equivalence are solvable for our model.
Xiande Zhang - One of the best experts on this subject based on the ideXlab platform.
-
String Concatenation construction for chebyshev permutation channel codes
International Symposium on Information Theory, 2016Co-Authors: Yeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Xiande ZhangAbstract:We construct codes for the Chebyshev permutation channels whose study was initiated by Langberg et al. (2015). We establish several recursive code constructions and present efficient decoding algorithms for our codes. In particular, our constructions yield a family of binary codes of rate 0.643 when r = 1. The upper bound on the rate in this case is 2/3 and the previous highest rate is 0.609.
-
ISIT - String Concatenation construction for Chebyshev permutation channel codes
2016 IEEE International Symposium on Information Theory (ISIT), 2016Co-Authors: Yeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Xiande ZhangAbstract:We construct codes for the Chebyshev permutation channels whose study was initiated by Langberg et al. (2015). We establish several recursive code constructions and present efficient decoding algorithms for our codes. In particular, our constructions yield a family of binary codes of rate 0.643 when r = 1. The upper bound on the rate in this case is 2/3 and the previous highest rate is 0.609.
Rajeev Alu - One of the best experts on this subject based on the ideXlab platform.
-
streaming tree transducers
Journal of the ACM, 2017Co-Authors: Rajeev Alu, Loris DantoniAbstract:The theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees (and forests) in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack, and a finite number of variables that store output chunks that can be combined using the operations of String-Concatenation and tree-insertion. We prove that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO). Existing models of tree transducers either cannot implement all MSO-definable transformations, or require regular look-ahead that prohibits single-pass implementation. We show a variety of analysis problems such as type-checking and checking functional equivalence are decidable for our model.
-
streaming tree transducers
International Colloquium on Automata Languages and Programming, 2012Co-Authors: Rajeev Alu, Loris DantoniAbstract:Theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees (and hedges) in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output using a finite-state control, a visibly pushdown stack, and a finite number of variables that store output chunks that can be combined using the operations of String-Concatenation and tree-insertion. We prove that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO). We establish complexity upper bounds of ExpTime for type-checking and NExpTime for checking functional equivalence for our model. We consider variations of the basic model when inputs/outputs are restricted to Strings and ranked trees, and in particular, present the model of bottom-up ranked-tree transducers, which is the first known MSO-equivalent transducer model that processes trees in a bottom-up manner.
-
streaming tree transducers
arXiv: Formal Languages and Automata Theory, 2011Co-Authors: Rajeev Alu, Loris DantoniAbstract:Theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack, and a finite number of variables that store output chunks that can be combined using the operations of String-Concatenation and tree-insertion. We prove that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO). Existing models of tree transducers either cannot implement all MSO-definable transformations, or require regular look ahead that prohibits single-pass implementation. We show a variety of analysis problems such as type-checking and checking functional equivalence are solvable for our model.
Yeow Meng Chee - One of the best experts on this subject based on the ideXlab platform.
-
String Concatenation construction for chebyshev permutation channel codes
International Symposium on Information Theory, 2016Co-Authors: Yeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Xiande ZhangAbstract:We construct codes for the Chebyshev permutation channels whose study was initiated by Langberg et al. (2015). We establish several recursive code constructions and present efficient decoding algorithms for our codes. In particular, our constructions yield a family of binary codes of rate 0.643 when r = 1. The upper bound on the rate in this case is 2/3 and the previous highest rate is 0.609.
-
ISIT - String Concatenation construction for Chebyshev permutation channel codes
2016 IEEE International Symposium on Information Theory (ISIT), 2016Co-Authors: Yeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Xiande ZhangAbstract:We construct codes for the Chebyshev permutation channels whose study was initiated by Langberg et al. (2015). We establish several recursive code constructions and present efficient decoding algorithms for our codes. In particular, our constructions yield a family of binary codes of rate 0.643 when r = 1. The upper bound on the rate in this case is 2/3 and the previous highest rate is 0.609.
Tuan Thanh Nguyen - One of the best experts on this subject based on the ideXlab platform.
-
String Concatenation construction for chebyshev permutation channel codes
International Symposium on Information Theory, 2016Co-Authors: Yeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Xiande ZhangAbstract:We construct codes for the Chebyshev permutation channels whose study was initiated by Langberg et al. (2015). We establish several recursive code constructions and present efficient decoding algorithms for our codes. In particular, our constructions yield a family of binary codes of rate 0.643 when r = 1. The upper bound on the rate in this case is 2/3 and the previous highest rate is 0.609.
-
ISIT - String Concatenation construction for Chebyshev permutation channel codes
2016 IEEE International Symposium on Information Theory (ISIT), 2016Co-Authors: Yeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Xiande ZhangAbstract:We construct codes for the Chebyshev permutation channels whose study was initiated by Langberg et al. (2015). We establish several recursive code constructions and present efficient decoding algorithms for our codes. In particular, our constructions yield a family of binary codes of rate 0.643 when r = 1. The upper bound on the rate in this case is 2/3 and the previous highest rate is 0.609.
