Deciding Twig-Definability of Node Selecting Tree Automata

Theory of Computing Systems - United States
doi 10.1007/s00224-015-9623-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Deciding Definability by Deterministic Regular Expressions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

As the Twig Is Bent, the Tree Inclines

Archives of General Psychiatry
2010English

Relating Word and Tree Automata

Annals of Pure and Applied Logic
Logic
2006English

Deciding Probabilistic Simulation Between Probabilistic Pushdown Automata and Finite-State Systems

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2019English

Hyper-Minimization for Deterministic Tree Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

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

Tree Automata Make Ordinal Theory Easy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Predicate Logic and Tree Automata With Tests

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy