Exact and approximate matching of matrix languages

DOI10.1080/09720529.2000.10697903MaRDI QIDQ4549936zbMATH OpenOpenAlexFDO

Authors

Publication date 28 August 2002

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2000.10697903

zbMATH Keywords

matchingmatrix languages

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1234889
• Approximate matching between a context-free grammar and a finite-state automaton
• Approximately matching context-free languages
• scientific article; zbMATH DE number 7278096
• Two-dimensional pattern matching against basic picture languages

Cites work

• Approximately matching context-free languages
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Picture languages with array rewriting rules

Cited in

(3)

• PARIKH MATRIX MAPPING AND LANGUAGES
• scientific article; zbMATH DE number 1234889 (Why is no real title available?)
• Approximately matching context-free languages

This page was built for publication: Exact and approximate matching of matrix languages

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