Search Results for Machines.

Machines, Computations, and Universality 7th International Conference, MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, Proceedings

Yazar

Durand-Lose, Jerome. editor.

http://dx.doi.org/10.1007/978-3-319-23111-2

Format:

Electronic Resources

Alıntı:

Machines, Computations, and Universality 7th International Conference, MCU 2015, Famagusta, North

Descriptional Complexity of Formal Systems 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings

Yazar

Câmpeanu, Cezar. editor.

http://dx.doi.org/10.1007/978-3-319-41114-9

Format:

Electronic Resources

Alıntı:

occur in computational models, such as Turing Machines, ﬁnte automata, grammars, splicing systems and

Model Checking Software 26th International Symposium, SPIN 2019, Beijing, China, July 15–16, 2019, Proceedings

Yazar

Biondi, Fabrizio. editor.

https://doi.org/10.1007/978-3-030-30923-7

Format:

Electronic Resources

Alıntı:

-- From Dynamic State Machines to Promela -- String abstraction for model checking of C programs -- Swarm

Implementation and Application of Automata 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings

Yazar

Han, Yo-Sub. editor.

http://dx.doi.org/10.1007/978-3-319-40946-7

Format:

Electronic Resources

Alıntı:

Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L -- Kuratowski Algebras Generated by

Descriptional Complexity of Formal Systems 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings

Yazar

Shallit, Jeffrey. editor.

http://dx.doi.org/10.1007/978-3-319-19225-3

Format:

Electronic Resources

Alıntı:

, pushdown automata, and Turing machines. Descriptional complexity serves as a theoretical representation of

Computing with New Resources Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday

Yazar

Calude, Cristian S. editor.

http://dx.doi.org/10.1007/978-3-319-13350-8

Format:

Electronic Resources

Alıntı:

Counterexamples -- One-Sided Random Context Grammars -- How Can We Construct Reversible Machines out of Reversible

Artificial General Intelligence 8th International Conference, AGI 2015, AGI 2015, Berlin, Germany, July 22-25, 2015, Proceedings

Yazar

Bieger, Jordi. editor.

http://dx.doi.org/10.1007/978-3-319-21365-1

Format:

Electronic Resources

Alıntı:

Description Length Principle for Probabilistic Programming -- Can Machines Learn Logics? -- Comparing Computer

	{displayName}	{count}
{error}