From Signal Transition Graphs to Timing Closure: Application to Bundled-Data Circuits

2019 ◽  
Author(s):  
Gregoire Gimenez ◽  
Jean Simatic ◽  
Laurent Fesquet
Keyword(s):  
Timing Closure ◽  
Transition Graphs

scholarly journals Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

2021 ◽  
Vol 22 (2) ◽  
pp. 1-37
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
C.-H. Luke Ong ◽  
Olivier Serre
Keyword(s):  
Model Checking ◽  
Free Variable ◽  
Higher Order ◽  
Second Order ◽  
Effective Solution ◽  
Parity Games ◽  
Transition Graphs ◽  
Second Order Logic ◽  
Pushdown Automata ◽  
Monadic Second Order Logic

This article studies the logical properties of a very general class of infinite ranked trees, namely, those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal -calculus, three main problems: model-checking, logical reflection (a.k.a. global model-checking, that asks for a finite description of the set of elements for which a formula holds), and selection (that asks, if exists, for some finite description of a set of elements for which an MSO formula with a second-order free variable holds). For each of these problems, we provide an effective solution. This is obtained, thanks to a known connection between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.

scholarly journals Automata for DNA Splicing Languages with Palindromic and Non-Palindromic Restriction Enzymes using Grammars

MATEMATIKA ◽  
2019 ◽  
Vol 35 (4) ◽  
pp. 1-14
Author(s):  
Wan Heng Fong ◽  
Nurul Izzaty Ismail ◽  
Nor Haniza Sarmin
Keyword(s):  
Dna Sequences ◽  
Formal Language ◽  
Restriction Enzymes ◽  
Language Theory ◽  
Dna Assembly ◽  
Dna Molecules ◽  
Splicing Systems ◽  
Transition Graphs ◽  
Palindromic Sequences ◽  
Dna Splicing

In DNA splicing system, DNA molecules are cut and recombined with the presence of restriction enzymes and a ligase. The splicing system is analyzed via formal language theory where the molecules resulting from the splicing system generate a language which is called a splicing language. In nature, DNA molecules can be read in two ways; forward and backward. A sequence of string that reads the same forward and backward is known as a palindrome. Palindromic and non-palindromic sequences can also be recognized in restriction enzymes. Research on splicing languages from DNA splicing systems with palindromic and non-palindromic restriction enzymes have been done previously. This research is motivated by the problem of DNA assembly to read millions of long DNA sequences where the concepts of automata and grammars are applied in DNA splicing systems to simplify the assembly in short-read sequences. The splicing languages generated from DNA splicing systems with palindromic and nonpalindromic restriction enzymes are deduced from the grammars which are visualised as automata diagrams, and presented by transition graphs where transition labels represent the language of DNA molecules resulting from the respective DNA splicing systems.

ON HOMOMORPHIC IMAGES OF TRANSITION GRAPHS

1963 ◽  
Author(s):  
Michael Yoeli ◽  
Abraham Ginzburg
Keyword(s):  
Transition Graphs
Sign in / Sign up

Export Citation Format

Share Document