Checking Determinism of Regular Expressions with Counting
暂无分享,去创建一个
[1] Thomas Schwentick,et al. Expressiveness and complexity of XML Schema , 2006, TODS.
[2] Stefanie Scherzinger,et al. Attribute grammars for scalable query processing on XML streams , 2003, The VLDB Journal.
[3] Pekka Kilpeläinen,et al. Towards efficient implementation of XML schema content models , 2004, DocEng '04.
[4] Pekka Kilpeläinen,et al. Checking determinism of XML Schema content models in optimal time , 2011, Inf. Syst..
[5] Derick Wood,et al. One-Unambiguous Regular Languages , 1998, Inf. Comput..
[6] Ping Lu,et al. Assisting the Design of XML Schema: Diagnosing Nondeterministic Content Models , 2011, APWeb.
[7] Dag Hovland,et al. The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints , 2012, LATA.
[8] Anne Brüggemann-Klein. Regular Expressions into Finite Automata , 1993, Theor. Comput. Sci..
[9] Thomas Schwentick,et al. Complexity of Decision Problems for Simple Regular Expressions , 2004, MFCS.
[10] Pekka Kilpeläinen,et al. One-unambiguity of regular expressions with numeric occurrence indicators , 2007, Inf. Comput..
[11] Derick Wood,et al. Deterministic Regular Languages , 1991, STACS.
[12] Marc Gyssens,et al. Regular Expressions with Counting: Weak versus Strong Determinism , 2009, SIAM J. Comput..
[13] Frank Neven,et al. Succinctness of the Complement and Intersection of Regular Expressions , 2008, TOCL.