Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Models Of Computation (F.1.1) > Automata (F.1.1...)  
 
Options:
 
  1-10 of 134 Reviews about "Automata (F.1.1...)": Date Reviewed
  Finite-state techniques: automata, transducers and bimachines
Mihov S., Schulz K., Cambridge University Press, New York, NY, 2019. 324 pp.  Type: Book (978-1-108485-41-8)

The mathematical theory of automata is one of the great ideas of computer science, easy to state and understand, yet with great explanatory power and potential for problem solving....

Oct 5 2020
  Regular language representations in the constructive type theory of Coq
Doczkal C., Smolka G. Journal of Automated Reasoning 61(1-4): 521-553, 2018.  Type: Article

Theoretical computer science is traditionally presented using paper and pencil, with little emphasis on formal correctness and completeness in detail. This provides a backdoor for ambiguities, gaps, and errors. However, nowadays, power...

Aug 16 2018
  Languages with membership determined by single letter factors
Higgins P., Alwan S. Theoretical Computer Science 680 15-24, 2017.  Type: Article

This paper continues a previous one [1] by the authors, Higgins and Alwan, expanding on the notion of scan languages that require a word to be read completely before determining whether the word belongs to the language. This applies to...

Mar 8 2018
   Non-regular unary language and parallel communicating Watson-Crick automata systems
Chatterjee K., Ray K. Theoretical Computer Science 705 113-117, 2018.  Type: Article

Watson-Crick finite automata have been introduced as a possible model of DNA computation. They differ from their classical counterpart in that they are capable of working on double-stranded sequences. The strands are processed by two i...

Feb 22 2018
  Link prediction in fuzzy social networks using distributed learning automata
Moradabadi B., Meybodi M. Applied Intelligence 47(3): 837-849, 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 s...

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): 1-28, 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 ...

Nov 17 2017
  Uniform continuity of relations and nondeterministic cellular automata
Furusawa H. Theoretical Computer Science 673 19-29, 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....

Oct 19 2017
  Accelerating worst case execution time analysis of timed automata models with cyclic behaviour
Al-Bataineh O., Reynolds M., French T. Formal Aspects of Computing 27(5-6): 917-949, 2015.  Type: Article

The worst-case execution time (WCET) is an important property of safety-critical systems. In general, a safety-critical system can be analyzed using a formal model. An established formalism for modeling such systems is a timed automato...

Mar 31 2016
  Deterministic ordered restarting automata for picture languages
Otto F., Mráz F. Acta Informatica 52(7-8): 593-623, 2015.  Type: Article

Languages of pictures (2D matrices with entries from a finite alphabet) have been studied since Blum and Hewitt [1]; Rosenfeld [2]; and Siromoney, Siromoney, and Krithivasan [3]. A nondeterministic notion of recognizability by tessella...

Dec 30 2015
  Entropy of regular timed languages
Asarin E., Basset N., Degorre A. Information and Computation 241(C): 142-176, 2015.  Type: Article

Tackling unexplored issues in timed automata and timed languages, this paper formalizes the “quantitative analysis of the size of these languages and of the information content of timed words.”...

Oct 20 2015
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy