Amanote Research

Amanote Research

    RegisterSign In

Generating, Sampling and Counting Subclasses of Regular Tree Languages

Theory of Computing Systems - United States
doi 10.1007/s00224-012-9428-x
Full Text
Open PDF
Abstract

Available in full text

Categories
Computational TheoryTheoretical Computer ScienceMathematics
Date

October 26, 2012

Authors
Timos AntonopoulosFloris GeertsWim MartensFrank Neven
Publisher

Springer Science and Business Media LLC


Related search

Union-Freeness of Regular Languages

International Journal of Computer Applications
2012English

Tree Algebra of Sofic Tree Languages

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2014English

Regular Languages in NC1

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1992English

Renormalized Measure of Regular Languages

International Journal of Control
ControlSystems EngineeringComputer Science Applications
2006English

Automata in Categories and Regular Languages

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1984English

Qualitative Tree Languages

2011English

Regular Languages Meet Prefix Sorting

2020English

Generating 5-Regular Planar Graphs

Journal of Graph Theory
GeometryTopology
2009English

Enumerating the Strings of Regular Languages

Journal of Functional Programming
Software
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy