scientific article; zbMATH DE number 2050933

MaRDI QIDQ4453207zbMATH OpenFDO

Authors Denis Maurel

Publication date 7 March 2004

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1949652
• Incremental Construction and Maintenance of Minimal Finite-State Automata
• scientific article; zbMATH DE number 1045406
• How to squeeze a lexicon
• On-line construction of a small automaton for a finite set of words

Cited in

(17)

• Finite-state abstractions on Arabic morphology
• Finite automata for compact representation of tuple dictionaries.
• Enumerated automata implementation of string dictionaries
• How to squeeze a lexicon
• Natural language dictionaries implemented as finite automata
• A Hybrid Approach to Word Segmentation of Vietnamese Texts
• Automata and dictionaries.
• scientific article; zbMATH DE number 1045406 (Why is no real title available?)
• scientific article; zbMATH DE number 1088298 (Why is no real title available?)
• scientific article; zbMATH DE number 2081045 (Why is no real title available?)
• scientific article; zbMATH DE number 1773087 (Why is no real title available?)
• scientific article; zbMATH DE number 2123348 (Why is no real title available?)
• AI 2003: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 2188489 (Why is no real title available?)
• VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION
• Compiling Linguistic Constraints into Finite State Automata
• The syntactic prediction with token automata: Application to HandiAS system

This page was built for publication:

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