- Radboud Repository
- →
- Browsing by Author
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Author "Zantema, H."
Now showing items 1-47 of 47
-
Synchronizing Non-Deterministic Finite Automata Don, H.; Zantema, H.2018, Article / Letter to editor (Journal of Automata, Languages and Combinatorics, vol. 23, iss. 4, (2018), pp. 307-328) -
TERMINATION OF CYCLE REWRITING BY TRANSFORMATION AND MATRIX INTERPRETATION Sabel, D.; Zantema, H.2017, Article / Letter to editor (Logical Methods in Computer Science, vol. 13, iss. 1, (2017), pp. 1-38)
-
Ordering sequences by permutation transducers 2017, Article / Letter to editor (Indagationes Mathematicae. New Series, vol. 28, iss. 1, (2017), pp. 38-54)
-
Finding DFAs with Maximal Shortest Synchronizing Word Length Don, H.; Zantema, H.2017, Article in monograph or in proceedings (Drewes, F.; Martín-Vide, C.; Truthe, B. (ed.), Language and Automata Theory and Applications: 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings, pp. 249-260) -
Classifying Non-periodic Sequences by Permutation Transducers 2017, Article in monograph or in proceedings (Charlier, É.; Leroy, J.; Rigo, M. (ed.), Developments in Language Theory: 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings, pp. 365-377)
-
DFAs and PFAs with Long Shortest Synchronizing Word Length Bondt, M. de ; Don, H.; Zantema, H.2017, Article in monograph or in proceedings (Charlier, É.; Leroy, J.; Rigo, M. (ed.), Developments in Language Theory: 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings, pp. 122-133)
-
TURTLE GRAPHICS OF MORPHIC SEQUENCES 2016, Article / Letter to editor (Fractals, vol. 24, iss. 1, (2016), pp. 1-16, article 1650009) -
TERMGRAPH 2016: Proceedings 9th International Workshop on Computing with Terms and Graphs Eindhoven, The Netherlands, April 8, 2016 Corradini, A.; Zantema, H.2016, Book (monograph)
-
A Probabilistic Analysis of the Game of the Goose Groote, J.F.; Wiedijk, F. ; Zantema, H.2016, Article / Letter to editor (Siam Review, vol. 58, iss. 1, (2016), pp. 143-155)
-
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings Bruggink, H.J.S.; König, B.; Nolte, D.; Zantema, H.2015, Part of book or chapter of book (Parisi-Presicce, F.; Westfechtel, B. (ed.), Graph Transformation : 8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings, pp. 52-68)
-
Proving non-termination by finite automata Endrullis, J.; Zantema, H.2015, Article in monograph or in proceedings (Fernandez, M. (ed.), RTA 2015 : 26th International Conference on Rewriting Techniques and Applications, June 29-July 1, 2015, Warsaw, Poland, pp. 160-176)
-
The Degree of Squares is an Atom Endrullis, J.; Grabmayer, C.; Hendriks, D.; Zantema, H.2015, Part of book or chapter of book (Manea, F.; Nowotka, D. (ed.), Combinatorics on Words : 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings, pp. 109-121)
-
Transforming Cycle Rewriting into String Rewriting Sabel, D.; Zantema, H.2015, Article in monograph or in proceedings (Fernandez, M. (ed.), RTA 2015 : 26th International Conference on Rewriting Techniques and Applications, June 29-July 1, 2015, Warsaw, Poland, pp. 285-300)
-
Termination of Cycle Rewriting Zantema, H. ; König, B.; Bruggink, H.J.S.2014, Part of book or chapter of book (Dowek, G. (ed.), Rewriting and Typed Lambda Calculi, pp. 476-490)
-
Termination Analysis for Graph Transformation Systems Bruggink, H.J.S.; König, B.; Zantema, H.2014, Part of book or chapter of book (Diaz, J.; Lanese, I.; Sangiorgi, D. (ed.), Theoretical Computer Science, pp. 179-194)
-
De kans om Ganzenbord te winnen Groote, J.F.; Zantema, H.2014, Article / Letter to editor (Nieuw Archief voor Wiskunde, vol. 15, iss. 4, (2014), pp. 234-239)
-
A Rewriting View of Simple Typing Stump, A.; Zantema, H. ; Kimmell, G.; El Haj Omar, R.2013, Article / Letter to editor (Logical Methods in Computer Science, vol. 9, iss. 1, (2013), pp. 4(1)-4(29))
-
Relaxation of 3-partition instances Joosten, S.J.C.; Zantema, H.2013, Article in monograph or in proceedings (CTW 2013 : 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, pp. 133-136)
-
Rna-editing with combined insertion and deletion preserves regularity Vink, E. de; Zantema, H. ; Bosnacki, D.2013, Article / Letter to editor (Scientific Annals of Computer Science 'Alexandru Ioan Cuza' University of Iasi, vol. 23, iss. 1, (2013), pp. 39-73)
-
Combining Insertion and Deletion in RNA-editing Preserves Regularity Vink, E.P. de; Zantema, H. ; Bosnacki, D.2012, Article in monograph or in proceedings (Ciobanu, G. (ed.), Proceedings 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi Newcastle, UK, 8th September 2012, pp. 48-62)
-
Triangulation in rewriting Oostrum, V. van; Zantema, H.2012, Article in monograph or in proceedings (Tiwari, A. (ed.), 23rd International Conference on Rewriting Techniques and Applications (RTA'12), pp. 240-255)
-
Proving equality of streams automatically Zantema, H. ; Endrullis, J.2011, Article in monograph or in proceedings (Schmidt-Schau, M. (ed.), 22nd International Conference on Rewriting Techniques and Applications (RTA'11), Novi sad, Serbia, May 30-June 1, 2011, pp. 393-408)
-
Levels of undecidability in rewriting Endrullis, J.; Geuvers, H. ; Simonsen, J.G.; Zantema, H.2011, Article / Letter to editor (Information and Computation, vol. 209, iss. 2, (2011), pp. 227-245)
-
Strategy independent reduction lengths in rewriting and binary arithmetic 2011, Article in monograph or in proceedings (Escobar, S. (ed.), Reduction Strategies in Rewriting and Programming 10th International Workshop, WRS 2011 Novi Sad, Serbia, 29 May 2011 : Informal proceedings, pp. 41-45)
-
Long-run order-independence of vector-based transition systems Raffelsieper, M.; Mousavi, M.R.; Zantema, H.2011, Article / Letter to editor (Iet Computers & Digital Techniques, vol. 5, iss. 6, (2011), pp. 468-478)
-
A problem from IMO 2010 2011, Article / Letter to editor (Nieuw Archief voor Wiskunde, vol. 5, iss. 12, (2011), pp. 40-43)
-
Stream productivity by outermost termination Zantema, H. ; Raffelsieper, M.2010, Article in monograph or in proceedings (Fernandez, M. (ed.), Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming Brasilia, Brazil, 28th June 2009, pp. 83-95)
-
Proving Productivity in Infinite Data Structures Zantema, H. ; Raffelsieper, M.2010, Article in monograph or in proceedings (Lynch, C. (ed.), Proceedings of the 21st International Conference on rewriting techniques and applications, RTA'10 July 11-13, Edinburgh, UK, pp. 401-416)
-
Order-Independence of vector-based transition systems Raffelsieper, M.; Mousavi, M.; Zantema, H.2010, Article in monograph or in proceedings (Proceedings - International Conference on Application of Concurrency to System Design, ACSD, pp. 115-123)
-
Well-definedness of streams by transformation and termination 2010, Article / Letter to editor (Logical Methods in Computer Science, vol. 6, iss. 3, (2010), pp. 1-27)
-
Liveness Verification in TRSs Using Tree Automata and Termination Analysis Mousazadeh, B.T.; Ladani, H.; Zantema, H.2010, Article / Letter to editor (Computing and Informatics, vol. 29, iss. 3, (2010), pp. 407-426)
-
Complexity of Guided Insertion-Deletion in RNA-Editing 2010, Part of book or chapter of book (Dediu, A.-H.; Fernau, H.; Martín Vide, C. (ed.), Language and Automata Theory and Applications : 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings, pp. 608-619)
-
An exponential lower bound on OBDD refutations for pigeonhole formulas Heling-Tveretina, O.; Sinz, C.; Zantema, H.2009, Article in monograph or in proceedings (Markakis, E.; Milis, I. (ed.), Proceedings of the 4th Athens Colloquium on Algorithms and Complexity ACAC 2009, pp. 13-21)
-
A tool proving well-definedness of streams using termination tools 2009, Article in monograph or in proceedings (Kurz, A.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, pp. 449-456)
-
Well-definedness of streams by termination 2009, Article in monograph or in proceedings (Treinen, R. (ed.), Rewriting Techniques and Applications : 20th International Conference, RTA 2009 Brasília, Brazil, June 29 - July 1, 2009 Proceedings, pp. 164-178)
-
Formal analysis of non-determinism in Verilog cell library simulation models Raffelsieper, M.; Mousavi, M.R.; Roorda, J.W.; Strolenberg, C.; Zantema, H.2009, Article in monograph or in proceedings (Alpuente, M.; Joubert, C.; Cook, B. (ed.), Formal Methods for Industrial Critical Systems (14th International Workshop, FMICS 2009, pp. 133-148)
-
Degrees of undecidability in term rewriting Endrullis, J.; Geuvers, J.H. ; Zantema, H.2009, Article in monograph or in proceedings (Grädel, E.; Kahle, R. (ed.), Computer Science Logic, 23rd international workshop, CSL 2009, pp. 255-270)
-
Adding constants to string rewriting Thiemann, R.; Zantema, H. ; Giesl, J.; Schneider-Kamp, P.2008, Article / Letter to editor (Applicable Algebra in Engineering, Communication and Computing, vol. 19, iss. 1, (2008), pp. 27-38)
-
Normalization of Infinite Terms 2008, Article in monograph or in proceedings (Voronkov, A. (ed.), Rewriting Techniques and Applications :19th International Conference, RTA 2008 Hagenberg, Austria, July 15-17, 2008 Proceedings, pp. 441-455)
-
Certification of provingtermination of term rewriting by matrix interpretations Koprowski, A.; Zantema, H.2008, Article in monograph or in proceedings (Geffert, V.; Karhumaki, J. (ed.), SOFSEM 2008: Theory and Practice of Computer Science , 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008. Proceedings, pp. 328-339)
-
Matrix Interpretations for Proving Termination of TermRewriting Endrullis, J.; Waldmann, J.; Zantema, H.2008, Article / Letter to editor (Journal of Automated Reasoning, vol. 40, iss. 2-3, (2008), pp. 195-220)
-
-
Finding Frequent Subgraphs in Biological Networks via Maximal Item Sets Zantema, H. ; Wagemans, S.; Bošnački, D.2008, Article in monograph or in proceedings (Murphy, R.; Elloumi, M. (ed.), Bioinformatics Research and Development : Second International Conference, BIRD 2008 Vienna, Austria, July 7-9, 2008 Proceedings, pp. 303-317)
-
The Termination Competition Marche, C.; Zantema, H.2007, Article in monograph or in proceedings (Baader, F. (ed.), Proceedings of the 18th Conference on Rewriting Techniques and Applications (RTA), pp. 303-313)
-
Termination by quasi-periodic interpretations Zantema, H. ; Waldmann, J.2007, Article in monograph or in proceedings (Baader, F. (ed.), Proceedings of the 18th Conference on Rewriting Techniques and Applications (RTA), pp. 404-418)
-
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems Geser, A.; Hofbauer, D.; Waldmann, J.; Zantema, H.2007, Article / Letter to editor (Information and Computation, vol. 205, iss. 4, (2007), pp. 512-534)
-
Now showing items 1-47 of 47
Search Repository
Browse
-
All of Repository
Upload Full Text