|
|
|
|
| LEADER |
04716nmm a2200361 u 4500 |
| 001 |
EB000654706 |
| 003 |
EBX01000000000000001349074 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540389293
|
| 100 |
1 |
|
|a Chytil, M.P.
|e [editor]
|
| 245 |
0 |
0 |
|a Mathematical Foundations of Computer Science 1984
|h Elektronische Ressource
|b 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings
|c edited by M.P. Chytil, V. Koubek
|
| 250 |
|
|
|a 1st ed. 1984
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1984, 1984
|
| 300 |
|
|
|a XIV, 586 p
|b online resource
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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 --
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Mathematical logic
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Mathematical Logic and Foundations
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Koubek, V.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/BFb0030285
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0030285?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|