Amanote Research

Amanote Research

    RegisterSign In

Hyper-Minimization for Deterministic Tree Automata

International Journal of Foundations of Computer Science - Singapore
doi 10.1142/s0129054113400200
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer Science
Date

September 1, 2013

Authors
ARTUR JEŻANDREAS MALETTI
Publisher

World Scientific Pub Co Pte Lt


Related search

Random Generation of Deterministic Tree (Walking) Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Deterministic Half Automata and Boolean Mappings

Journal of Computer Science Technology Updates
2015English

Deterministic Automata Simulation, Universality and Minimality

Annals of Pure and Applied Logic
Logic
1997English

Deterministic and Stochastic Primal-Dual Subgradient Algorithms for Uniformly Convex Minimization

Stochastic Systems
2014English

Relating Word and Tree Automata

Annals of Pure and Applied Logic
Logic
2006English

Reducing an Operational Supervisory Control Problem by Decomposition for Deterministic Pushdown Automata

IFAC Proceedings Volumes
2014English

Rabin-Mostowski Index Problem: A Step Beyond Deterministic Automata

2013English

Processing XML Streams With Deterministic Automata and Stream Indexes

ACM Transactions on Database Systems
Information Systems
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy