Amanote Research

Amanote Research

    RegisterSign In

Rough Approximations in Varieties of Regular Languages

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2011-591
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
Date

January 1, 2011

Authors
Gabriela MartinMagnus Steinby
Publisher

IOS Press


Related search

Regular Languages in NC1

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

Union-Freeness of Regular Languages

International Journal of Computer Applications
2012English

Multi Topological Approximations of Rough Set Theory

International Journal of Granular Computing, Rough Sets and Intelligent Systems
2013English

Rough Approximations Under Level Fuzzy Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Automata in Categories and Regular Languages

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

Renormalized Measure of Regular Languages

International Journal of Control
ControlSystems EngineeringComputer Science Applications
2006English

Regular Languages Meet Prefix Sorting

2020English

Dual Mathematical Models Based on Rough Approximations

Journal of Japan Society for Fuzzy Theory and Systems
2001English

Enumerating the Strings of Regular Languages

Journal of Functional Programming
Software
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy