<電子ブック>
Mathematical Foundations of Computer Science 1984 : 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings / edited by M.P. Chytil, V. Koubek
(Lecture Notes in Computer Science. ISSN:16113349 ; 176)
版 | 1st ed. 1984. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 1984 |
本文言語 | 英語 |
大きさ | XIV, 586 p : online resource |
著者標目 | Chytil, M.P editor Koubek, V editor SpringerLink (Online service) |
件 名 | LCSH:Computer science LCSH:Machine theory LCSH:Mathematical logic FREE:Theory of Computation FREE:Formal Languages and Automata Theory FREE:Mathematical Logic and Foundations |
一般注記 | 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 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 HTTP:URL=https://doi.org/10.1007/BFb0030285 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783540389293 |
|
電子リソース |
|
EB00224994 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA75.5-76.95 DC23:004.0151 |
書誌ID | 4001088803 |
ISBN | 9783540389293 |