Amanote Research

Amanote Research

    RegisterSign In

Relating Word and Tree Automata

Annals of Pure and Applied Logic - Netherlands
doi 10.1016/j.apal.2005.06.009
Full Text
Open PDF
Abstract

Available in full text

Categories
Logic
Date

March 1, 2006

Authors
Orna KupfermanShmuel SafraMoshe Y. Vardi
Publisher

Elsevier BV


Related search

Predicate Logic and Tree Automata With Tests

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Hyper-Minimization for Deterministic Tree Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Tree Automata Make Ordinal Theory Easy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Random Generation of Deterministic Tree (Walking) Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Construction of Tree Automata From Regular Expressions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Combining Equational Tree Automata Over AC and ACI Theories

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Modeling and Synthesis of Service Composition Using Tree Automata

2008English

Deciding Twig-Definability of Node Selecting Tree Automata

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2015English

Equivalences Between Ranked and Unranked Weighted Tree Automata via Binarization

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy