Finite-State Registered Automata for Non-Concatenative Morphology Yael Cohen-Sygal∗ Shuly Wintner†

Source URL: cs.haifa.ac.il

• Models of computation
• Computer science
• Applied mathematics
• Finite state transducer
• Finite-state machine
• Regular language
• Circumfix
• Ω-automaton
• Automata theory
• Formal languages
• Theoretical computer science