Остановите войну!
for scientists:
default search action
Hans Zantema
- > Home > Persons > Hans Zantema
Publications
- 2023
- [i15]Hans Zantema:
Characterizing morphic sequences. CoRR abs/2309.10562 (2023) - 2022
- [c61]Hans Zantema:
Passive Automata Learning: DFAs and NFAs. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 575-580 - [i14]Hans Zantema:
Complexity of Simon's problem in classical sense. CoRR abs/2211.01776 (2022) - 2020
- [c59]Hans Zantema:
Complexity of Automatic Sequences. LATA 2020: 260-271 - 2018
- [j34]Hans Zantema:
Finding small counterexamples for abstract rewriting properties. Math. Struct. Comput. Sci. 28(8): 1485-1505 (2018) - 2011
- [c44]Hans Zantema:
Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic. WRS 2011: 69-76 - 2010
- [j26]Hans Zantema:
Well-definedness of Streams by Transformation and Termination. Log. Methods Comput. Sci. 6(3) (2010) - [c42]Hans Zantema:
Complexity of Guided Insertion-Deletion in RNA-Editing. LATA 2010: 608-619 - 2009
- [c40]Hans Zantema:
A Tool Proving Well-Definedness of Streams Using Termination Tools. CALCO 2009: 449-456 - [c37]Hans Zantema:
Well-Definedness of Streams by Termination. RTA 2009: 164-178 - 2008
- [c33]Hans Zantema:
Normalization of Infinite Terms. RTA 2008: 441-455 - 2005
- [j19]Hans Zantema:
Termination of String Rewriting Proved Automatically. J. Autom. Reason. 34(2): 105-139 (2005) - [c26]Hans Zantema:
Reducing Right-Hand Sides for Termination. Processes, Terms and Cycles 2005: 173-197 - 2004
- [c21]Hans Zantema:
TORPA: Termination of Rewriting Proved Automatically. RTA 2004: 95-104 - 2001
- [j14]Hans Zantema:
The Termination Hierarchy for Term Rewriting. Appl. Algebra Eng. Commun. Comput. 12(1/2): 3-19 (2001) - 1997
- [c14]Hans Zantema:
Termination of Context-Sensitive Rewriting. RTA 1997: 172-186 - 1995
- [j6]Hans Zantema:
Termination of Term Rewriting by Semantic Labelling. Fundam. Informaticae 24(1/2): 89-105 (1995) - [j5]Hans Zantema:
Total Termination of Term Rewriting is Undecidable. J. Symb. Comput. 20(1): 43-60 (1995) - 1994
- [j3]Hans Zantema:
Termination of Term Rewriting: Interpretation and Type Elimination. J. Symb. Comput. 17(1): 23-50 (1994) - 1992
- [j2]Hans Zantema:
Longest Segment Problems. Sci. Comput. Program. 18(1): 39-66 (1992) - [c2]Hans Zantema:
Type Removal in Term Rewriting. CTRS 1992: 148-154 - [c1]Hans Zantema:
Termination of Term Rewriting by Interpretation. CTRS 1992: 155-167 - 1991
- [j1]Hans Zantema:
Minimizing Sums of Addition Chains. J. Algorithms 12(2): 281-307 (1991)
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 2023-09-28 03:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint