default search action
Christian Mathissen
Person information
- affiliation: Leipzig University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j5]Markus Lohrey, Christian Mathissen:
Isomorphism of regular trees and words. Inf. Comput. 224: 71-105 (2013) - 2012
- [j4]Niko Haubold, Markus Lohrey, Christian Mathissen:
Compressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups. Int. J. Algebra Comput. 22(8) (2012) - 2011
- [c6]Ina Fichtner, Christian Mathissen:
Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids. Algebraic Foundations in Computer Science 2011: 94-111 - [c5]Markus Lohrey, Christian Mathissen:
Compressed Membership in Automata with Compressed Labels. CSR 2011: 275-288 - [c4]Markus Lohrey, Christian Mathissen:
Isomorphism of Regular Trees and Words. ICALP (2) 2011: 210-221 - [i1]Markus Lohrey, Christian Mathissen:
Isomorphism of regular trees and words. CoRR abs/1102.2782 (2011) - 2010
- [j3]Christian Mathissen:
Weighted Logics for Nested Words and Algebraic Formal Power Series. Log. Methods Comput. Sci. 6(1) (2010) - [j2]Christian Mathissen:
Definable transductions and weighted logics for texts. Theor. Comput. Sci. 411(3): 631-659 (2010) - [c3]Niko Haubold, Markus Lohrey, Christian Mathissen:
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups. Developments in Language Theory 2010: 218-230
2000 – 2009
- 2009
- [b1]Christian Mathissen:
Weighted Automata and Weighted Logics over Tree-like Structures. Leipzig University, Germany, 2009, ISBN 978-3-86853-180-0, pp. 1-148 - [j1]Christian Mathissen:
Existential MSO over two successors is strictly weaker than over linear orders. Theor. Comput. Sci. 410(38-40): 3982-3987 (2009) - 2008
- [c2]Christian Mathissen:
Weighted Logics for Nested Words and Algebraic Formal Power Series. ICALP (2) 2008: 221-232 - 2007
- [c1]Christian Mathissen:
Definable Transductions and Weighted Logics for Texts. Developments in Language Theory 2007: 324-336
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: