Factor and Subsequence Kernels and Signatures of Rational Languages

DOI10.1007/978-3-642-31606-7_27zbMATH Open1297.68104OpenAlexW8728285MaRDI QIDQ2914720FDOQ2914720

Authors: Ahmed Amarni, Sylvain Lombardy 

Publication date: 20 September 2012

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_27

Recommendations

• The signature of rational languages
• Notes on congruence relations and factor pumping conditions for rational languages
• Kernels of sub-classes of context-free languages
• scientific article; zbMATH DE number 2162119
• Kuratowski algebras generated by factor-, subword-, and suffix-free languages
• On the structure and complexity of rational sets of regular languages
• scientific article; zbMATH DE number 1836425
• scientific article; zbMATH DE number 176496
• COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES
• scientific article; zbMATH DE number 6004833

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Elements of automata theory. Translated from the French by Reuben Thomas
• 10.1162/153244302760200687
• Title not available (Why is that?)
• Kernel methods for learning languages
• Positive definite rational kernels.
• Rational kernels: theory and algorithms

Cited In (7)

• Speech recognition by composition of weighted finite automata
• Rational kernels: theory and algorithms
• Learning Languages with Rational Kernels
• Some alternatives to Parikh matrices using string kernels
• Pairwise rational kernels obtained by automaton operations
• Positive definite rational kernels.
• Kernel methods for learning languages

This page was built for publication: Factor and Subsequence Kernels and Signatures of Rational Languages

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