Author of the publication

Refining the Taxonomy of XML Schema Languages. A new Approach for Categorizing XML Schema Languages in Terms of Processing Complexity

, and . Proceedings of Balisage Markup Conference 2010, volume 5 of Balisage Series on Markup Technologies, (2010)
DOI: 10.4242/BalisageVol5.Stuhrenberg01

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Cantor-Bendixson Analysis of Finite Trees.. FG, volume 8612 of Lecture Notes in Computer Science, page 185-200. Springer, (2014)Synchronous Regular Relations and Morphological Analysis., and . FSMNLP, page 35-38. The Association for Computer Linguistics, (2013)Virtual-Source Modeling of N-polar GaN MISHEMTS., , , , , , , , , and 1 other author(s). BCICTS, page 1-4. IEEE, (2019)Record 1 W output power from a single N-Polar GaN MISHEMT at 94 GHz., , , , , , , , , and 1 other author(s). DRC, page 1-2. IEEE, (2023)Concepts and Types - An Application to Formal Language Theory.. CLA, volume 972 of CEUR Workshop Proceedings, page 103-114. CEUR-WS.org, (2012)On Some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results.. FG, volume 9804 of Lecture Notes in Computer Science, page 164-179. Springer, (2015)The Logic of Ambiguity: The Propositional Case.. FG, volume 10686 of Lecture Notes in Computer Science, page 88-104. Springer, (2017)Refining the Taxonomy of XML Schema Languages. A new Approach for Categorizing XML Schema Languages in Terms of Processing Complexity, and . Proceedings of Balisage Markup Conference 2010, volume 5 of Balisage Series on Markup Technologies, (2010)The Lattice of Automata Classes: on ?Mild? Extensions of Pushdown Automata.. NCMA, volume 290 of books@ocg.at, page 213-228. Österreichische Computer Gesellschaft, (2012)Completeness of Full Lambek Calculus for Syntactic Concept Lattices.. FG, volume 8036 of Lecture Notes in Computer Science, page 126-141. Springer, (2012)