Finite state transducers with predicates and identities

DOI10.1023/A:1012291501330zbMath1015.68087OpenAlexW2113283819MaRDI QIDQ700795

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)

Related Items (8)

Finite-State Registered Automata for Non-Concatenative Morphology ⋮ LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES ⋮ A New Method for Compiling Parallel Replacement Rules ⋮ Symbolic tree automata ⋮ Forward Bisimulations for Nondeterministic Symbolic Finite Automata ⋮ From Sequential Extended Regular Expressions to NFA with Symbolic Labels ⋮ An Evaluation of Automata Algorithms for String Analysis ⋮ Extended symbolic finite automata and transducers

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