Parametric random generation of deterministic tree automata
type: Item
instance of: scholarly article
title: Parametric random generation of deterministic tree automata
zbMATH Open document ID: 1209.68298
author: Cyril Nicaud
author: Sylvain Schmitz
author: Pierre-Cyrille Héam
published in: Theoretical Computer Science
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5796907
zbMATH Keywords: random generation
zbMATH Keywords: average complexity
zbMATH Keywords: tree automaton
describes a project that uses: Antichains
describes a project that uses: REGAL
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.05.036
OpenAlex ID: W2066694987
cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata
cites work: Five Determinisation Algorithms
cites work: Büchi Complementation Made Tight
cites work: Q5389971
cites work: Q4941149
cites work: Tree-Walking Automata Do Not Recognize All Regular Languages
cites work: Transitive closure logic, nested tree walking automata, and XPath
cites work: Experimental Evaluation of Classical Automata Constructions
cites work: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
cites work: Visibly pushdown languages
cites work: Enumeration and random generation of accessible automata
cites work: Q3077339
cites work: Random generation of DFAs
cites work: REGAL: A Library to Randomly and Exhaustively Generate Automata
cites work: Learning Minimal Separating DFA’s for Compositional Verification
cites work: Uniform random generation of decomposable structures using floating-point arithmetic
DOI: 10.1016/J.TCS.2010.05.036
description: scientific article; zbMATH DE number 5796907