Увійти

Готові списки джерел за темами / Finite state automata / Книги

Книги з теми "Finite state automata"

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Finite state automata.

Автор: Grafiati

Опубліковано: 4 червня 2021

Оновлено: 8 червня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-23 книг для дослідження на тему "Finite state automata".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте книги для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Sifakis, Joseph, ed. Automatic Verification Methods for Finite State Systems. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-52148-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Ferdinand, Wagner, ed. Modeling software with finite state machines: A practical approach. Boca Raton, FL: Taylor & Francis, 2006.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Carson-Berndsen, Julie. Time Map Phonology: Finite State Models and Event Logics in Speech Recognition. Dordrecht: Springer Netherlands, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Time map phonology: Finite state models and event logics in speech recognition. Dordrecht: Kluwer, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Schulz, Klaus U., and Stoyan Mihov. Finite-State Techniques: Automata, Transducers and Bimachines. Cambridge University Press, 2019.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Schulz, Klaus U., and Stoyan Mihov. Finite-State Techniques: Automata, Transducers and Bimachines. Cambridge University Press, 2019.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Karttunen, Lauri. Finite-State Technology. Edited by Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0018.

Повний текст джерела

Анотація:

The article introduces the basic concepts of finite-state language processing: regular languages and relations, finite-state automata, and regular expressions. Many basic steps in language processing, ranging from tokenization, to phonological and morphological analysis, disambiguation, spelling correction, and shallow parsing, can be performed efficiently by means of finite-state transducers. The article discusses examples of finite-state languages and relations. Finite-state networks can represent only a subset of all possible languages and relations; that is, only some languages are finite-state languages. Furthermore, this article introduces two types of complex regular expressions that have many linguistic applications, restriction and replacement. Finally, the article discusses the properties of finite-state automata. The three important properties of networks are: that they are epsilon free, deterministic, and minimal. If a network encodes a regular language and if it is epsilon free, deterministic, and minimal, the network is guaranteed to be the best encoding for that language.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Aubry, Jean François, and Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Aubry, Jean François, and Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Aubry, Jean François, and Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Aubry, Jean François, and Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Shornikov, Yury V. Theory of Programming Languages: Design and Implementation. Novosibirsk State Technical University, 2022. http://dx.doi.org/10.17212/978-5-7782-4817-5.

Повний текст джерела

Анотація:

The textbook has been prepared in accordance with the State educational Standard in the fields of "Computer Science and Computer Engineering" (09.03.01), "Applied Computer Science" (09.03.03) for the cycle of disciplines of information specialties. The basis of the textbook was the material of lectures delivered by the author to students of the relevant specialties at the Novosibirsk State Technical University and the Kazakh-British Technical University in the courses "Theory of Formal Languages and Compilers", "System Software", and "Linguistic Support". The textbook discusses the theory of generating grammars, finite automata and regular expressions. All theoretical mechanisms of analysis and synthesis of language constructions are strictly formalized and constitute the theoretical foundations of the programming language design. The implementation of programming languages is represented by the development of language processors. The transition from formal languages to language processors is carried out through constructive analysis methods with strict modeling algorithms that can be implemented in high-level languages or with the help of modern programming automation tools. The manual discusses ANTLR and FLEX & BIZON tools for automating parser and lexer programming. Despite the educational orientation, the manual can be useful to anyone who is engaged in the design and implementation of new languages, language processors and finite-automaton recognizers.

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Hori, Takaaki, and Atsushi Nakamura. Speech Recognition Algorithms Based on Weighted Finite-State Transducers. Morgan & Claypool Publishers, 2013.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Hori, Takaaki, and Atsushi Nakamura. Speech Recognition Algorithms Based on Weighted Finite-State Transducers. Springer International Publishing AG, 2012.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Hori, Takaaki, and Atsushi Nakamura. Speech Recognition Algorithms Based on Weighted Finite-State Transducers. Morgan & Claypool Publishers, 2013.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Barkalov, Alexander, Larysa Titarenko, and Jacek Bieganowski. Logic Synthesis for Finite State Machines Based on Linear Chains of States: Foundations, Recent Developments and Challenges. Springer, 2018.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Barkalov, Alexander, Larysa Titarenko, and Jacek Bieganowski. Logic Synthesis for Finite State Machines Based on Linear Chains of States: Foundations, Recent Developments and Challenges. Springer, 2017.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Harmon, James Edward. Automated design of a microprogrammed controller for a Finite State Machine. 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Automatic verification methods for finite state systems: International workshop, Grenoble, France, June 12-14, 1989 : proceedings. Berlin: Springer-Verlag, 1990.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Sifakis, J. Automatic Verification Methods for Finite State Systems: International Workshop, Grenoble, France June 12-14, 1989 : Proceedings (Lecture Notes in Computer Science). Springer, 1990.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Sifakis, Joseph. Automatic Verification Methods for Finite State Systems: International Workshop, Grenoble, France. June 12-14, 1989. Proceedings (Lecture Notes in Computer Science). Not Avail, 1990.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Trost, Harald. Morphology. Edited by Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0002.

Повний текст джерела

Анотація:

This article discusses in detail computational morphology with examples from various languages. It deals with the processing of words in both their graphemic, i.e. written, and their phonemic, i.e. spoken form. It has a wide range of practical applications such as spelling correction or automated hyphenation. It further seeks the fact that these tasks may seem simple to a human but they pose hard problems to a computer program. This article provides insights into why this is so and what techniques are available to tackle these tasks. It discusses the sort of information that is expressed by morphology and differs widely between languages and looks at the constraints involved in morphotactics. It is responsible for governing the rules for the combination of morphs into larger entities. It concludes with an outline of finite-state morphology and alternative formalisms.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Grishman, Ralph. Information Extraction. Edited by Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0030.

Повний текст джерела

Анотація:

Information extraction (IE) is the automatic identification of selected types of entities, relations, or events in free text. This article appraises two specific strands of IE — name identification and classification, and event extraction. Conventional treatment of languages pays little attention to proper names, addresses etc. Presentations of language analysis generally look up words in a dictionary and identify them as nouns etc. The incessant presence of names in a text, makes linguistic analysis of the same difficult, in the absence of the names being identified by their types and as linguistic units. Name tagging involves creating, several finite-state patterns, each corresponding to some noun subset. Elements of the patterns would match specific/classes of tokens with particular features. Event extraction typically works by creating a series of regular expressions, customized to capture the relevant events. Enhancement of each expression is corresponded by a relevant, suitable enhancement in the event patterns.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!