Finite state transducers with predicates and identities

DOI10.1023/A:1012291501330zbMATH Open1015.68087OpenAlexW2113283819MaRDI QIDQ700795FDOQ700795

Gertjan van Noord, Dale Gerdemann

Publication date: 8 October 2002

Published in: Grammars (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012291501330

zbMATH Keywords

finite state automatadeterminization and minimization of automatafinite state recognizersfinite state transducersnaturallanguage processing

Mathematics Subject Classification ID

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

Cited In (21)

• Title not available (Why is that?)
• Title not available (Why is that?)
• An Evaluation of Automata Algorithms for String Analysis
• From Sequential Extended Regular Expressions to NFA with Symbolic Labels
• Finite-state transducer cascades to extract named entities in texts.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extended symbolic finite automata and transducers
• LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES
• A New Method for Compiling Parallel Replacement Rules
• Injection Structures Specified by Finite State Transducers
• VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION
• Forward Bisimulations for Nondeterministic Symbolic Finite Automata
• Symbolic tree automata
• Finite State Transducers with Intuition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The syntactic prediction with token automata: Application to HandiAS system
• Finite-State Registered Automata for Non-Concatenative Morphology
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Finite State Transducers with Intuition 👍 👎
• Finite transducers and nondeterministic state complexity of regular languages 👍 👎
• Symbolic finite state transducers 👍 👎
• Inference of finite-state transducers from regular languages 👍 👎
• Polynomial time identification of strict prefix deterministic finite state transducers 👍 👎
• Title not available (Why is that?) 👍 👎
• Deciding sequentiability of finite-state transducers by finite-state pattern-matching. 👍 👎
• FINITELY SUBSEQUENTIAL TRANSDUCERS 👍 👎
• Finite-State Techniques 👍 👎

This page was built for publication: Finite state transducers with predicates and identities

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