Pseudo-minimal transducer

DOI10.1016/S0304-3975(99)00022-5zbMath0951.68063MaRDI QIDQ1575902

Denis Maurel

Publication date: 23 August 2000

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

zbMATH Keywords

acyclic deterministic finite state machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50)

Related Items

On building minimal automaton for subset matching queries, Exact enumeration of acyclic deterministic automata, The syntactic prediction with token automata: Application to HandiAS system, A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata

Cites Work

• Unnamed Item
• Unnamed Item
• Minimization algorithms for sequential transducers