Finite-State Registered Automata and Their Uses in Natural Languages

Lecture Notes in Computer Science - Germany
doi 10.1007/11780885_6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Finite-State Registered Automata for Non-Concatenative Morphology

Computational Linguistics
LinguisticsComputer Science ApplicationsArtificial IntelligenceLanguage
2006English

Finite-State Automata on Infinite Inputs

2012English

Automata, Languages and Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Automata, Languages and Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Automata in Categories and Regular Languages

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1984English

Limited Automata and Unary Languages

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2019English

Simulasi Vending Machine Dengan Mengimplementasikan Finite State Automata

JOINTECS (Journal of Information Technology and Computer Science)
2018English

Generalized Automata and Stochastic Languages

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1969English

Implementation of Finite State Automata Using fLIF Neurons

2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy