scholarly journals Proof method for correctness of refinements of algebraic specification in abstract sequential machine style

1996 ◽  
Vol 27 (5) ◽  
pp. 25-38
Author(s):  
Kozo Okano ◽  
Teruo Higashino ◽  
Kenichi Taniguchi
1972 ◽  
Vol C-21 (4) ◽  
pp. 371-381
Author(s):  
Charles A. Harlow ◽  
Clarence L. Coates
Keyword(s):  

2010 ◽  
Vol 21 (05) ◽  
pp. 799-815 ◽  
Author(s):  
TOMMI LEHTINEN ◽  
ALEXANDER OKHOTIN

It is proved that the language family generated by Boolean grammars is effectively closed under injective gsm mappings and inverse gsm mappings (where gsm stands for a generalized sequential machine). The same results hold for conjunctive grammars, unambiguous Boolean grammars and unambiguous conjunctive grammars.


1998 ◽  
pp. 171-217
Author(s):  
V. S. Alagar ◽  
K. Periyasamy

Sign in / Sign up

Export Citation Format

Share Document