Characterisation of language intersections using distances

DOI10.1142/S0129054125500261MaRDI QIDQ7363227zbMATH OpenFDO

Authors Branislav Rovan, Andras Varga

Publication date 29 September 2026

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054125500261

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites work

• Approximate matching between a context-free grammar and a finite-state automaton
• Approximate matching between a context-free grammar and a finite-state automaton
• Approximate membership for regular languages modulo the edit distance
• Computing the edit-distance between a regular language and a context-free language
• Distances of formal languages
• Edit distance for pushdown automata
• Edit distance neighbourhoods of input-driven pushdown automata
• Edit-distance between visibly pushdown languages
• Finite Approximations and Similarity of Languages
• scientific article; zbMATH DE number 1361478 (Why is no real title available?)
• Parameterized Prefix Distance between Regular Languages
• Prefix distance between regular languages
• Relative prefix distance between languages
• State complexity of prefix distance

This page was built for publication: Characterisation of language intersections using distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363227)