Zaloguj się

Gotowe bibliografie tematyczne / Finite state automata / Książki

Książki na temat „Finite state automata”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Finite state automata.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 8 czerwca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 23 najlepszych książek naukowych na temat „Finite state automata”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj książki z różnych dziedzin i twórz odpowiednie bibliografie.

1

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

8

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

13

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

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

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

23

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!