Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter October 9, 2009

On the complexity of computation of rudimentary predicates

  • S. S. MARCHENKOV
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.2000.10.6.571
Published Online: 2009-10-09
Published in Print: 2000

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 10 Issue 6

Journal and Issue

Articles in the same Issue

Titelei
Sojourn times for Markov branching processes and the probabilities of extinction of a modified Galton-Watson process
On permutations with cycle lengths in a random set
On some properties of complete by expressibility systems of formulas in the Gödel–Löb provability logic
On the complexity of computation of rudimentary predicates
On the number of rules needed for the automaton grammar to generate a finite language
On the traversal of labyrinths in n-dimensional space by automata
The completeness criterion for systems which contain all one-place finite-automaton functions
CONTENTS OF VOLUMES 1—10
Downloaded on 19.4.2024 from https://www.degruyter.com/document/doi/10.1515/dma.2000.10.6.571/html
Scroll to top button