
Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Models Of Computation (F.1.1) > Automata (F.1.1...)









110 of 266
Reviews about "Automata (F.1.1...)":

Date Reviewed 

Link prediction in fuzzy social networks using distributed learning automata Moradabadi B., Meybodi M. Applied Intelligence 47(3): 837849, 2017. Type: Article Link prediction is an active area within the broader research on social network analysis (SNA) that tries to predict future links using a social network structure. The purpose of link prediction is to use the current structure of the social networ...

Nov 28 2017 

The logical view on continuous Petri nets Blondin M., Finkel A., Haase C., Haddad S. ACM Transactions on Computational Logic 18(3): 128, 2017. Type: Article The reachability problem for standard Petri nets is EXPSPACE hard, and the coverability problem is EXPSPACE complete. However, more efficient algorithms exist for variants of the standard nets. Continuous Petri nets are such a variant that allows ...

Nov 17 2017 

Uniform continuity of relations and nondeterministic cellular automata Furusawa H. Theoretical Computer Science 673 1929, 2017. Type: Article Cellular automata are computational structures that can be applied for modeling a wide range of systems in different areas of science. Usually they are characterized by local rules operating on individual cells and their neighborhoods. This paper ...

Oct 19 2017 

Idea makers: personal perspectives on the lives & ideas of some notable people Wolfram S., Wolfram Media Inc., Champaign, IL, 2016. 250 pp. Type: Book (9781579550035) We all know Stephen Wolfram as the creator of Mathematica. In this short book, he gives us his perspective on a number of people who have had an impact on computer science and, of course, on Wolfram. The size of these discussions is highly variabl...

Aug 23 2017 

A mathematical theory of resources Coecke B., Fritz T., Spekkens R. Information and Computation 2505986, 2016. Type: Article Many of the physical sciences ultimately deal with resources. The important questions are: Can a given resource be converted into another? And if so, how? Examples abound:...

Apr 12 2017 

Behavioural models: from modelling finite automata to analysing business processes Kunze M., Weske M., Springer International Publishing, New York, NY, 2016. 279 pp. Type: Book (9783319449586) Like a typical industrial automation system, modern business systems are (near) real time, concurrent, and distributed. However, before established techniques of automation such as finite automata can be used, the behavior of (business) systems mu...

Feb 28 2017 

The grammar of mammalian brain capacity Rodriguez A., Granger R. Theoretical Computer Science 633(C): 100111, 2016. Type: Article Which aspects of the language faculty are uniquely human, and which are shared with other mammals? In this paper, Rodriguez and Granger try to address this fundamental question from an innovative neurocomputational perspective. They convincingly ...

Sep 15 2016 

Modelling and verification of weighted spiking neural systems Aman B., Ciobanu G. Theoretical Computer Science 623(C): 92102, 2016. Type: Article This paper considers the problem of formal verification of systems described using an abstract computing model called a spiking neural system, which is modeled after how brain cells (neurons) communicate. A spiking neural system is a concurrent se...

Jul 13 2016 

Nonrecursive tradeoffs between twodimensional automata and grammars Průša D. Theoretical Computer Science 610, Part A, 121132, 2016. Type: Article All computer scientists should be familiar with the theory of onedimensional strings including the automata that can recognize them and the grammars that generate them. But the twodimensional version is terra incognita to many, and wildly differ...

May 20 2016 

On bounded languages and reversalbounded automata Ibarra O., Ravikumar B. Information and Computation 2463042, 2016. Type: Article A language L is bounded contextfree if it is accepted by a pushdown automaton (PDA) M with a bounded number of reversals; that is, there is a constant upper bound for the number of times M ...

May 2 2016 





