Prefix Distance Between Regular Languages (Q2830223)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Prefix Distance Between Regular Languages	scientific article

Statements

scholarly article

0 references

Prefix Distance Between Regular Languages (English)

0 references

0 references

Implementation and Application of Automata

0 references

publication date

9 November 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-40946-7_19

0 references

Bounded repairability of word languages

0 references

The per-character cost of repairing word languages

0 references

String distances and intrusion detection: Bridging the gap between formal languages and computer security

0 references

Distances between languages and reflexivity of relations

0 references

0 references

Encyclopedia of Distances

0 references

Handbook of weighted automata

0 references

THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE

0 references

0 references

Computing the edit distance of a regular language

0 references

Computing Maximal Error-detecting Capabilities and Distances of Regular Languages

0 references

Parameterized Prefix Distance between Regular Languages

0 references

EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS

0 references

How hard is computing the edit distance?

0 references

A Second Course in Formal Languages and Automata Theory

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-40946-7_19

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2830223

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2830223&oldid=36286556"