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
  Basset, Nicolas Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  Counting and generating permutations in regular classes
Basset N. Algorithmica 76(4): 989-1034, 2016.  Type: Article

The signature of a permutation can be described in terms of two symbols that represent ascent and descent in the ordering of the elements. For each regular language (that can be recognized by a finite-state automaton) over those two sy...
...
May 19 2017  
  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  

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