Autor:	Klaus U. Schulz, Stoyan Mihov
Rok vydání:	2019
Předmět:	Finite-state machine Computer science media_common.quotation_subject Finite state Parallel computing Simplicity Inefficiency Implementation Automaton media_common
DOI:	10.1017/9781108756945.009
Popis:	In this chapter we present C(M) implementations of the main automata constructions. Our aim is to provide full descriptions of the implementations that are clear and easy to follow. In some cases the simplicity of the implementation is achieved at the expense of some inefficiency.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::6da06dc13f74d2af7fa987730d9ba189 https://doi.org/10.1017/9781108756945.009 Zobrazit plný text záznamu