Automata Theory Based on Quantum Logic: Recognizability and Accessibility

被引：1

作者：

Liu, Jun ^{[1
]}

Mo, Zhi-wen ^{[1
]}

机构：

[1] Sichuan Normal Univ, Coll Math & Software Sci, Chengdu 610066, Sichuan, Peoples R China

来源：

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS | 2009年 / 48卷 / 04期

基金：

中国国家自然科学基金;

关键词：

Quantum logic; Quantum automata; PUSHDOWN-AUTOMATA;

D O I：

10.1007/s10773-008-9888-6

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

Inspired by Ying's work on automata theory based on quantum logic and classical automata theory, we introduce the concepts of reversal, accessible, coaccessible and complete part of finite state automata based on quantum logic. Some properties of them are discussed. More importantly we investigate the recognizability and accessibility properties of these types on the framework of quantum logic by employing the approach of semantic analysis.

引用

页码：1150 / 1163

页数：14

共 22 条

[1] The logic of quantum mechanics [J].

Birkhoff, G ;

von Neumann, J .

ANNALS OF MATHEMATICS, 1936, 37 :823-843

[2] Grammar theory based on quantum logic [J].

Cheng, W ;

Wang, J .

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2003, 42 (08) :1677-1691

[3]

GREECHIE R, 1981, CURRENT ISSUES QUANT, V8, P375

[4] Quantum computers [J].

Gudder, S .

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2000, 39 (09) :2151-2177

[5] Basic properties of quantum automata [J].

Gudder, S .

FOUNDATIONS OF PHYSICS, 2000, 30 (02) :301-319

[6] Properties of quantum languages [J].

Gudder, S ;

Ball, R .

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2002, 41 (04) :569-591

[7] Quantum automata: An overview [J].

Gudder, S .

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1999, 38 (09) :2261-2282

[8]

Hopcroft J., 1979, Introduction to automata theory, languages, and computation

[9]

KONDACS A, 1997, 38 ANN S FDN COMP SC

[10]

Lu RQ, 2003, INT J THEOR PHYS, V42, P1425

← 1 2 3 →