State Complexity of Prefix Distance (Q2947426)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	State Complexity of Prefix Distance	scientific article

Statements

scholarly article

0 references

State Complexity of Prefix Distance (English)

0 references

0 references

David Rappaport

0 references

0 references

Implementation and Application of Automata

0 references

publication date

23 September 2015

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-22360-5_20

0 references

Maximal Words in Sequence Comparisons Based on Subword Composition

0 references

Intersection and union of regular languages and state complexity

0 references

0 references

Distances between languages and reflexivity of relations

0 references

Encyclopedia of Distances

0 references

Descriptional and computational complexity of finite automata -- a survey

0 references

0 references

Efficient algorithms for computing the inner edit distance of a regular language via transducers

0 references

Computing the edit distance of a regular language

0 references

Parameterized Prefix Distance between Regular Languages

0 references

0 references

0 references

Quasi-Distances and Weighted Finite Automata

0 references

STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA

0 references

A Second Course in Formal Languages and Automata Theory

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-22360-5_20

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2947426

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