Finding finite automata that certify termination of string rewriting

Autor:	Geser, A., Hofbauer, D., Waldmann, J., Zantema, H., Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S.
Přispěvatelé:	Formal System Analysis
Jazyk:	angličtina
Rok vydání:	2005
Předmět:	Discrete mathematics Finite-state machine TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Confluence String (computer science) Quantum finite automata Tree automaton Rewriting Mathematics
Zdroj:	Implementation and Application of Automata (Revised Selected Papers, Ninth International Conference, CIAA 2004, Kingston ON, Canada, July 22-24, 2004), 134-145 STARTPAGE=134;ENDPAGE=145;TITLE=Implementation and Application of Automata (Revised Selected Papers, Ninth International Conference, CIAA 2004, Kingston ON, Canada, July 22-24, 2004) Implementation and Application of Automata ISBN: 9783540243182 CIAA
Popis:	We present a technique based on the construction of finite automata to prove termination of string rewriting systems. Using this technique the tools Matchbox and TORPA are able to prove termination of particular string rewriting systems completely automatically for which termination was considered to be very hard until recently.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b109650bcbad2c7f76bd6421c016fe40 https://research.tue.nl/en/publications/1cd8d964-945d-4f8d-ac4b-389942d97812 Zobrazit plný text záznamu