Complexities of Order-Related Formal Language Extensions
作者： Martin Berglund
DOI:
关键词:
摘要: The work presented in this thesis discusses various formal language formalisms that extend classical like regular expressions and context-free grammars with additional abilities, most re ...
参考文章(99)
Martin Berglund, Characterizing Non-Regularity Umeå universitet. ,(2014)
James Kirrage, Asiri Rathnayake, Hayo Thielecke, Static Analysis for Regular Expression Denial-of-Service Attacks Network and System Security. pp. 135- 148 ,(2013) , 10.1007/978-3-642-38631-2_11
Mark-Jan Nederhof, Eberhard Bertsch, On the Complexity of Some Extensions of RCG Parsing international workshop/conference on parsing technologies. pp. 66- 77 ,(2001)
H.-J. Kreowski, F. Drewes, A. Habel, Hyperedge replacement graph grammars Handbook of graph grammars and computing by graph transformation. pp. 95- 162 ,(1997)
Rauno Tuhkanen, Pekka Kilpeläinen, Regular Expressions with Numerical Occurrence Indicators - preliminary results. SPLST. pp. 163- 173 ,(2003)
章治郎 室, Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 情報処理. ,vol. 21, pp. 902- 903 ,(1980)
Martin Berglund, Analyzing Edit Distance on Trees : Tree Swap Distance is Intractable prague stringology conference. pp. 59- 73 ,(2011)
Carl Jesse Pollard, Generalized Phrase Structure Grammars, Head Grammars and Natural Language Ph. D Dissertation, Stanford University. ,(1984)
Holger Petersen, The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL symposium on theoretical aspects of computer science. pp. 513- 522 ,(2002) , 10.1007/3-540-45841-7_42
Martin Fürer, The Complexity of the Inequivalence Problem for Regular Expressions with Intersection international colloquium on automata, languages and programming. pp. 234- 245 ,(1980) , 10.1007/3-540-10003-2_74