Compiling Linguistic Constraints into Finite State Automata

DOI10.1007/11812128_23MaRDI QIDQ5757245zbMATH OpenOpenAlexFDO

Authors Matthieu Constant, Denis Maurel

Publication date 6 September 2007

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

Full work available at URL https://doi.org/10.1007/11812128_23

Mathematics Subject Classification ID

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

Cited in

(6)

• scientific article; zbMATH DE number 1952681 (Why is no real title available?)
• scientific article; zbMATH DE number 1952734 (Why is no real title available?)
• scientific article; zbMATH DE number 1962774 (Why is no real title available?)
• scientific article; zbMATH DE number 5199133 (Why is no real title available?)
• scientific article; zbMATH DE number 2188489 (Why is no real title available?)
• VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION

This page was built for publication: Compiling Linguistic Constraints into Finite State Automata

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