×

Found 66 Documents (Results 1–66)

Hybrid tree automata and the yield theorem for constituent tree automata. (English) Zbl 07572314

Caron, Pascal (ed.) et al., Implementation and application of automata. 26th international conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13266, 93-105 (2022).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Refining the process rewrite systems hierarchy via ground tree rewrite systems. (English) Zbl 1344.68164

Katoen, Joost-Pieter (ed.) et al., CONCUR 2011 – concurrency theory. 22nd international conference, CONCUR 2011, Aachen, Germany, September 6–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23216-9/pbk). Lecture Notes in Computer Science 6901, 543-558 (2011).
MSC:  68Q85 68Q42
PDFBibTeX XMLCite
Full Text: DOI

Closure of tree automata languages under innermost rewriting. (English) Zbl 1294.68103

Middeldorp, Aart (ed.), Proceedings of the 8th international workshop on reduction strategies in rewriting and programming (WRS 2008), Castle of Hagenberg, Austria, July 14, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 237, 23-38 (2009).
MSC:  68Q45 68Q42
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software