- 3 resultados
menor preço: € 74.89, preço mais alto: € 74.96, preço médio: € 74.94
1
Fundamentals of Computation Theory - Marek Karpinski
Encomendar
no/na Springer.com
€ 74.96
EncomendarLink patrocinado
Marek Karpinski:

Fundamentals of Computation Theory - nuovo livro

ISBN: 9783540370840

Mathematics; Mathematical Logic and Foundations; Computer Science, general Computation, Informatik, Text, algorithms, automata, calculus, complexity, set theory Books eBook, Springer Scie… mais…

  - Custos de envio:zzgl. Versandkosten, mais custos de envio
2
Fundamentals of Computation Theory - Marek Karpinski
Encomendar
no/na Springer.com
€ 74.96
EncomendarLink patrocinado

Marek Karpinski:

Fundamentals of Computation Theory - nuovo livro

ISBN: 9783540370840

Mathematics; Mathematical Logic and Foundations; Computer Science, general Computation, Informatik, Text, algorithms, automata, calculus, complexity, set theory Books eBook, Springer Nature

  - Custos de envio:zzgl. Versandkosten., mais custos de envio
3
Fundamentals of Computation Theory - Marek Karpinski
Encomendar
no/na Springer.com
€ 74.89
Envio: € 0.001
EncomendarLink patrocinado
Marek Karpinski:
Fundamentals of Computation Theory - nuovo livro

ISBN: 9783540370840

There is currently no description available Books > Mathematics eBook, Springer Shop

new in stock. Custos de envio:zzgl. Versandkosten. (EUR 0.00)

1Como algumas plataformas não transmitem condições de envio e estas podem depender do país de entrega, do preço de compra, do peso e tamanho do item, de uma possível adesão à plataforma, de uma entrega direta pela plataforma ou através de um fornecedor terceirizado (Marketplace), etc., é possível que os custos de envio indicados pela terralivro não correspondam aos da plataforma ofertante.

Dados bibliográficos do melhor livro correspondente

Pormenores referentes ao livro

Dados detalhados do livro - Fundamentals of Computation Theory


EAN (ISBN-13): 9783540370840
Editor/Editora: Springer Science+Business Media

Livro na base de dados desde 2017-01-29T14:51:17-02:00 (Sao Paulo)
Página de detalhes modificada pela última vez em 2021-08-28T02:39:22-03:00 (Sao Paulo)
Número ISBN/EAN: 9783540370840

Número ISBN - Ortografia alternativa:
978-3-540-37084-0
Ortografia alternativa e termos de pesquisa relacionados:
Título do livro: fundamentals computation theory


Dados da editora

Autor: Marek Karpinski
Título: Lecture Notes in Computer Science; Fundamentals of Computation Theory - Proceedings of the 1977 International FCT-Conference. Poznan - Kornik, Poland, September 19 - 23, 1977
Editora: Springer; Springer Berlin
546 Páginas
Ano de publicação: 2005-07-05
Berlin; Heidelberg; DE
Língua: Inglês
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIV, 546 p.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Grundlagen; Mathematik: Logik; Verstehen; Computation; Informatik; Text; algorithms; automata; calculus; complexity; set theory; C; Mathematical Logic and Foundations; Computer Science; Computer Science; Mathematische Grundlagen; Informatik; BC

Methodology of proving a finite-state stochastic representability and nonrepresentability.- Non deterministic recursive program schemes.- Some remarks on relational composition in computational theory and practice.- An axiomatization of the rational data objects.- Some recent results on recognizable formal power series.- Canonical forms of context-free grammars and position restricted grammar forms.- Environments, labyrinths and automata.- Automata in labyrinths.- Stochastic algebras and stochastic automata over general measurable spaces: Algebraic theory and a decomposition theorem.- Some remarks on the algebra of automaton mappings.- Algebraic semantics of type definitions and structured variables.- Universal algebras and tree automata.- Vectors of coroutines over blikle nets.- Initial algebraic semantics for non context-free languages.- Reading functions and an extension of Kleene theorem for some families of languages.- Operations on ?-regular languages.- On the relation between graph grammars and graph L-systems.- On the theory of syntactic monoids for rational languages.- The equivalence of schemata with some feedbacks.- Disjunctive languages and codes.- Families of R-fuzzy Languages.- Algebras of partial sequences — A tool to deal with concurrency.- Remarks on fixed points of functors.- Recognizable and regular languages in a category.- Free dynamics and algebraic semantics.- Efficient state-splitting.- Nets over many sorted operator domains and their semantics.- Embedding theorems in the algebraic theory of graph grammars.- Some "geometrical" categories associated with flowchart schemes.- On partial recursive definitions and programs.- Transformations of derivation sequences in graph grammars.- Applicability of a production in a categorical grammar.- Onorder-complete universal algebra and enriched functorial semantics.- Functorial semantics of the type free ?-?? calculus.- A more categorical model of universal algebra.- Graph grammars.- Fixed-points and algebras with infinitely long expressions, II.- Relational automata in a category and their languages.- Generalized linton algebras.- On analysis of protoschemes.- Using determinancy of games to eliminate quantifiers.- Non-generable RE sets.- Polynomial time algorithms in the theory of linear diophantine equations.- Complexity of common subsequence problems.- Complexity of sequence encodings.- Network complexity.- On computability of Kolmogorov complexity.- The equivalences problems for binary EOL-Systems are decidable.- On a theory of inductive inference.- On finite and infinite computations.- Expected behavior of graph coloring algorithms.- Two NP-complete problems related to information retrieval.- On properties of certain synchronizing tool for parallel computations.- The parallel complexity of arithmetic computation.- Maximal rectangular relations.- A Dushnik - Miller type dimension of graphs and its complexity.- Programmability and P=NP conjecture.- An algorithmic approach to set theory.- Decidability of ? — Trees with bounded sets — A survey.- Empty - storage - acceptance of ? - languages.- Degrees of circuit complexity.- Recursive ?-languages.- A generalized computability thesis.

< Para arquivar...