Amanote Research

Amanote Research

    RegisterSign In

Computing Maximal Error-Detecting Capabilities and Distances of Regular Languages

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2010-287
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
Date

January 1, 2010

Authors
Stavros KonstantinidisPedro V. Silva
Publisher

IOS Press


Related search

Computation of Distances for Regular and Context-Free Probabilistic Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2008English

Union-Freeness of Regular Languages

International Journal of Computer Applications
2012English

Maximal Metrically Regular Sets

Siberian Electronic Mathematical Reports
Mathematics
2018English

Regular Languages in NC1

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

Computing Capabilities of Mediators

1999English

Maximal Infinite-Valued Constraint Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

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

Regular Languages Meet Prefix Sorting

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy