Random Generation of Deterministic Tree (Walking) Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-02979-0_15
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Hyper-Minimization for Deterministic Tree Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Incremental Evolution of Cellular Automata for Random Number Generation

International Journal of Modern Physics C
Nonlinear PhysicsMathematical PhysicsStatisticalMathematicsComputer Science ApplicationsComputational TheoryAstronomyPhysics
2003English

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

Logical Characterization of Weighted Pebble Walking Automata

2014English

Relating Word and Tree Automata

Annals of Pure and Applied Logic
Logic
2006English

On Properties and State Complexity of Deterministic State-Partition Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Compressibility of Deterministic and Random Infinite Sequences

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy