Mathematical foundations of computer science 1975 : 4th Symposium, Mariánské Lázně, September 1-5, 1975
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
2005.
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
32 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematical foundations of computer science 1975, 4th Symposium, Mariánské Lázně, September 1-5, 1975, edited by J. Bečvář, Berlin, Springer-Verlag, 1975, 1 vol. (X-476 p.), Lecture notes in computer science, 3-540-07389-2 • Mathematical Foundations of Computer Science 1975, Texte imprimé, 9783662196823 |
İçindekiler:
- Construction of complete sample system for correctness testing
- Ten years of speedup
- On logics of discovery
- On models of protection in operating systems
- Parsing as a subtask of compiling
- Parallel recursive program schemes
- On some problems concerning Pawlak's machines
- Formal power series and growth functions of Lindenmayer systems
- On the representability of relations by deterministic and nondeterministic multi-tape automata
- On problems solvable by successive trials
- Automata and categories
- On some models of computability of boolean functions
- Automata and categories: Finiteness contra minimality
- Languages over free groups
- On the comparison of notions of approximation
- Non-linear speed-up theorem for two register minsky machines
- Systems of open paths in Petri nets
- On the largest full sub AFL of the full AFL of context-free languages
- On complexity of nondeterministic Turing machines computations
- On closure properties of context-free derivation complexity classes
- Control structures in single block programs
- Minimal Gödel numbers and their identification in the limit
- Isomorphic representation of automata
- Extended simple regular expressions
- Conniver programs by logical point of view
- On the set of all automata with the same monoid of endomorphisms
- Nondeterministically recognizable sets of languages
- The approximation problem in computational statistics
- The continuous algebra of monadic languages
- On sets of complex-programmed Numbers
- Decision algorithms for Havel's branching automata
- Automata and categories Input processes
- Formalization of algorithmic reasoning
- Proving program properties, symbolic evaluation and logical procedural semantics
- A contribution to error recovery
- On the analysis and synthesisproblems for context-free expressions
- Monotone switching circuits and boolean matrix product
- On some lattice-theoretic properties of generable languages
- On some formal grammars generating dependency trees
- Graph walking automata
- On finding all solutions of the partitioning problem
- Greibach normal form complexity
- On correctness and essentiality of some Ianov schemas equivalence relations
- Polynomially complete problems in the logic of automate discovery
- Relational definition of computer languages
- First-order reduction of call-by-name to call-by-value
- Local disambiguating transformation
- On cardinal sequential outer measures
- On representation of sequential and parallel functions
- The theory of the modified post algebras and multidimensional automata structures
- An algebraic theory of formal languages
- On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups
- On the synthesis of automata with several initial states
- A hierarchy of regular sequence sets
- R-fuzzy grammars
- Characterization of some classes of context-free languages in terms of complexity classes
- Inductive inference of recursive functions
- Proving properties of programs by means of predicate logic
- A generalization of Scott's flow diagrams.