Limitations of non-deterministic finite automata imposed by one letter input alphabet

被引：0

作者：

Mancinska, L ^{[1
]}

Ozols, N ^{[1
]}

Praude, R ^{[1
]}

Zalcmane, A ^{[1
]}

机构：

[1] Latvian State Univ, Dept Comp Sci, LV-1459 Riga, Latvia

来源：

FCS '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER SCIENCE | 2005年

关键词：

finite automata; NFA; one letter input alphabet; limitations of NFA; unreachable subsets;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

NFA (Non-deterministic Finite Automata) usually requires significantly less states than DFA (Deterministic Finite Automata) to recognize the same language. The power of NFA lies in its ability to be in man), states simultaneously (i.e., in a subset of its state set). The usage of one letter input alphabet puts some restrictions on this ability of NFAs and decreases the gap between NFAs and DFAs. We discuss limitations of NFAs in one letter input alphabet and show that approximately 1/4 of all subsets of state set are unreachable and for every fixed k epsilon{2.,number(-)of(-)states-2} at least one subset of size k is unreachable.

引用

页码：161 / 166

页数：6

共 50 条

[21] A Novel Algorithm for the Conversion of Parallel Regular Expressions to Non-deterministic Finite Automata
Kumar, Ajay
Verma, Anil Kumar
APPLIED MATHEMATICS & INFORMATION SCIENCES, 2014, 8 (01): : 95 - 105
[22] GODEL, NON-DETERMINISTIC SYSTEMS, AND HERMETIC AUTOMATA
DESMONDE, WH
INTERNATIONAL PHILOSOPHICAL QUARTERLY, 1971, 11 (01) : 49 - 74
[23] ADAPTIVE TESTS DERIVATION FOR NON-DETERMINISTIC AUTOMATA
Gromov, M. L.
Yevtushenko, N., V
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2009, 6 (04): : 90 - 101
[24] On the Use of Non-deterministic Automata for Presburger Arithmetic
Durand-Gasselin, Antoine
Habermehl, Peter
CONCUR 2010 - CONCURRENCY THEORY, 2010, 6269 : 373 - +
[25] NAPOLY: A Non-deterministic Automata Processor OverLaY
Karakchi, Rasha
Bakos, Jason D.
ACM TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS, 2023, 16 (03)
[26] Minimization of non-deterministic automata with large alphabets
Abdulla, PA
Deneux, J
Kaati, L
Nilsson, M
IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 31 - 42
[27] A Compiler Framework for Fixed-topology Non-deterministic Finite Automata on SIMD Platforms
Nourian, Marziyeh
Wu, Hancheng
Becchi, Michela
2018 IEEE 24TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS 2018), 2018, : 507 - 516
[28] Conversion of Parallel Regular Expressions to Non-deterministic Finite Automata using Partial Derivatives
Kumar, Ajay
Verma, Anil Kumar
CHIANG MAI JOURNAL OF SCIENCE, 2014, 41 (5.2): : 1409 - 1418
[29] Efficient Multistriding of Large Non-deterministic Finite State Automata for Deep Packet Inspection
Avalle, Matteo
Risso, Fulvio
Sisto, Riccardo
2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2012,
[30] Cellular non-deterministic automata and partial differential equations
Kohler, D.
Mueller, J.
Weyer, U.
PHYSICA D-NONLINEAR PHENOMENA, 2015, 311 : 1 - 16

← 1 2 3 4 5 →