The size of subsequence automaton

DOI10.1016/J.TCS.2005.03.027MaRDI QIDQ2566019zbMATH OpenOpenAlexFDO

Authors Zdeněk Troníček, Ayumi Shinohara

Publication date 22 September 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.03.027

zbMATH Keywords

Directed acyclic subsequence graphSearching subsequencesSubsequence automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The size of subsequence automaton.
• scientific article; zbMATH DE number 1962790
• Searching subsequences

Cites work

• Directed acyclic subsequence graph -- overview
• Searching subsequences
• The On-Line Encyclopedia of Integer Sequences

Cited in

(8)

• scientific article; zbMATH DE number 2185636 (Why is no real title available?)
• On the joint subword complexity of automatic sequences
• On problems related to absent subsequences
• On the height of towers of subsequences and prefixes
• The size of subsequence automaton.
• THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA
• scientific article; zbMATH DE number 1962790 (Why is no real title available?)
• On the state complexity of closures and interiors of regular languages with subwords and superwords

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: The size of subsequence automaton

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