9783540133728 - mathematical foundations of computer science 1984: 11th symposium praha, czechoslovakia september 3-7, 1984. proceedings: 176 (lecture notes in computer science, 176) de chytil, m. p.; koubek, v. (8 resultados)
- Tapa blanda
Librería: Better World Books, Mishawaka, IN, Estados Unidos de AmericaBetter World Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 40,55
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
- Tapa blanda
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 61,26
Envío por EUR 14,03Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Tapa blanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 48,37
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
- Tapa blanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 64,48Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Separating, strongly separating, and collapsing relativized complexity classes.- Complexity of quantifier elimination in the theory of algebraically closed fields.- Systolic automata ¿ power, characterizations, nonhomogeneity.- A note on unique dec…ipherability.- Outline of an algebraic language theory.- Thue systems and the Church-Rosser property.- Limits, higher type computability and type-free languages.- Traces, histories, graphs: Instances of a process monoid.- Recent results on automata and infinite words.- VLSI algorithms and architectures.- Decidability of monadic theories.- On the Ehrenfeucht conjecture on test sets and its dual version.- Sparse oracles, lowness, and highness.- Computability of probabilistic parameters for some classes of formal languages.- A truely morphic characterization of recursively enumerable sets.- On the Herbrand Kleene universe for nondeterministic computations.- An investigation of controls for concurrent systems by abstract control languages.- On generalized words of Thue-Morse.- Nondeterminism is essential for two-way counter machines.- Weak and strong fairness in CCS.- On the complexity of inductive inference.- Monotone edge sequences in line arrangements and applications.- Many-sorted temporal logic for multi-processes systems.- Process logics : two decidability results.- On searching of special classes of mazes and finite embedded graphs.- The power of the future perfect in program logics.- Hierarchy of reversal and zerotesting bounded multicounter machines.- On the power of alternation in finite automata.- The equivalence problem and correctness formulas for a simple class of programs.- Lower bounds for polygon simplicity testing and other problems.- A uniform independence of invariant sentences.- On the equivalence of compositions of morphisms and inverse morphisms on regular languages.- Some connections between presentability of complexity classes and the power of formal systems of reasoning.- Finding a maximum flow in /s,t/-planar network in linear expected time.- Nondeterministic logspace reductions.- Factoring multivariate polynomials over algebraic number fields.- G¿del numberings, principal morphisms, combinatory algebras.- Representations of integers and language theory.- New lower bound for polyhedral membership problem with an application to linear programming.- Decidability of the equivalence problem for synchronous deterministic pushdown automata.- Models and operators for nondeterministic processes.- Algorithms for string editing which permit arbitrarily complex edit constraints.- The structure of polynomial complexity cores.- Solving visibility problems by using skeleton structures.- Another look at parameterization using algebras with subsorts.- A lower bound on complexity of branching programs.- From dynamic algebras to test algebras.- Combinatorial games with exponential space complete decision problems.- Fast recognitions of pushdown automaton and context-free languages.- Multiprocessor systems and their concurrency.- Free constructions in algebraic institutions.- Remarks on comparing expressive power of logics of programs.- The complexity of problems concerning graphs with regularities.- On the complexity of slice functions.- An exponential lower bound for one-time-only branching programs.- A topological view of some problems in complexity theory.- Propositional dynamic logic with strong loop predicate.
- Tapa blanda
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Bueno
EUR 127,83
Envío por EUR 29,27Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.
Idioma: Inglés
Editorial: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1984, 1984
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Separating, strongly separating, and collapsing relativized complexity classes.- Complexity of quantifier elimination in the theory of algebraically closed fields.- Systolic automata ¿ power, characterizations, nonhomogeneity.- A no…te on unique decipherability.- Outline of an algebraic language theory.- Thue systems and the Church-Rosser property.- Limits, higher type computability and type-free languages.- Traces, histories, graphs: Instances of a process monoid.- Recent results on automata and infinite words.- VLSI algorithms and architectures.- Decidability of monadic theories.- On the Ehrenfeucht conjecture on test sets and its dual version.- Sparse oracles, lowness, and highness.- Computability of probabilistic parameters for some classes of formal languages.- A truely morphic characterization of recursively enumerable sets.- On the Herbrand Kleene universe for nondeterministic computations.- An investigation of controls for concurrent systems by abstract control languages.- On generalized words of Thue-Morse.- Nondeterminism is essential for two-way counter machines.- Weak and strong fairness in CCS.- On the complexity of inductive inference.- Monotone edge sequences in line arrangements and applications.- Many-sorted temporal logic for multi-processes systems.- Process logics : two decidability results.- On searching of special classes of mazes and finite embedded graphs.- The power of the future perfect in program logics.- Hierarchy of reversal and zerotesting bounded multicounter machines.- On the power of alternation in finite automata.- The equivalence problem and correctness formulas for a simple class of programs.- Lower bounds for polygon simplicity testing and other problems.- A uniform independence of invariant sentences.- On the equivalence of compositions of morphisms and inverse morphisms on regular languages.- Some connections between presentability of complexity classes and the power of formal systems of reasoning.- Finding a maximum flow in /s,t/-planar network in linear expected time.- Nondeterministic logspace reductions.- Factoring multivariate polynomials over algebraic number fields.- G¿del numberings, principal morphisms, combinatory algebras.- Representations of integers and language theory.- New lower bound for polyhedral membership problem with an application to linear programming.- Decidability of the equivalence problem for synchronous deterministic pushdown automata.- Models and operators for nondeterministic processes.- Algorithms for string editing which permit arbitrarily complex edit constraints.- The structure of polynomial complexity cores.- Solving visibility problems by using skeleton structures.- Another look at parameterization using algebras with subsorts.- A lower bound on complexity of branching programs.- From dynamic algebras to test algebras.- Combinatorial games with exponential space complete decision problems.- Fast recognitions of pushdown automaton and context-free languages.- Multiprocessor systems and their concurrency.- Free constructions in algebraic institutions.- Remarks on comparing expressive power of logics of programs.- The complexity of problems concerning graphs with regularities.- On the complexity of slice functions.- An exponential lower bound for one-time-only branching programs.- A topological view of some problems in complexity theory.- Propositional dynamic logic with strong loop predicate. 600 pp. Englisch.
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Separating, strongly separating, and collapsing relativized complexity classes.- Complexity of quantifier elimination in the theory of algebraically closed fields.- Systolic automata - power, characterizations, nonhomogeneity.- A note o…n unique decipherability.- Outline of an algebraic language theory.- Thue systems and the Church-Rosser property.- Limits, higher type computability and type-free languages.- Traces, histories, graphs: Instances of a process monoid.- Recent results on automata and infinite words.- VLSI algorithms and architectures.- Decidability of monadic theories.- On the Ehrenfeucht conjecture on test sets and its dual version.- Sparse oracles, lowness, and highness.- Computability of probabilistic parameters for some classes of formal languages.- A truely morphic characterization of recursively enumerable sets.- On the Herbrand Kleene universe for nondeterministic computations.- An investigation of controls for concurrent systems by abstract control languages.- On generalized words of Thue-Morse.- Nondeterminism is essential for two-way counter machines.- Weak and strong fairness in CCS.- On the complexity of inductive inference.- Monotone edge sequences in line arrangements and applications.- Many-sorted temporal logic for multi-processes systems.- Process logics : two decidability results.- On searching of special classes of mazes and finite embedded graphs.- The power of the future perfect in program logics.- Hierarchy of reversal and zerotesting bounded multicounter machines.- On the power of alternation in finite automata.- The equivalence problem and correctness formulas for a simple class of programs.- Lower bounds for polygon simplicity testing and other problems.- A uniform independence of invariant sentences.- On the equivalence ofcompositions of morphisms and inverse morphisms on regular languages.- Some connections between presentability of complexity classes and the power of formal systems of reasoning.- Finding a maximum flow in /s,t/-planar network in linear expected time.- Nondeterministic logspace reductions.- Factoring multivariate polynomials over algebraic number fields.- Gödel numberings, principal morphisms, combinatory algebras.- Representations of integers and language theory.- New lower bound for polyhedral membership problem with an application to linear programming.- Decidability of the equivalence problem for synchronous deterministic pushdown automata.- Models and operators for nondeterministic processes.- Algorithms for string editing which permit arbitrarily complex edit constraints.- The structure of polynomial complexity cores.- Solving visibility problems by using skeleton structures.- Another look at parameterization using algebras with subsorts.- A lower bound on complexity of branching programs.- From dynamic algebras to test algebras.- Combinatorial games with exponential space complete decision problems.- Fast recognitions of pushdown automaton and context-free languages.- Multiprocessor systems and their concurrency.- Free constructions in algebraic institutions.- Remarks on comparing expressive power of logics of programs.- The complexity of problems concerning graphs with regularities.- On the complexity of slice functions.- An exponential lower bound for one-time-only branching programs.- A topological view of some problems in complexity theory.- Propositional dynamic logic with strong loop predicate.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 600 pp. Englisch.
- Tapa blanda
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 50,25
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. Mathematical Foundations of Computer Science 1984 | 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings | M. P. Chytil (u. a.) | Taschenbuch | xiv | Englisch | 1984 | Springer | EAN 9783540133728 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Hei…delberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
