Name
Abstract | ||
|---|---|---|
This note introduces two-dimensional probabilistic finite automata (2-pfa's), and investigates several properties of them. We first show that the class of sets recognized by 2-pfa's with bounded error probability, 2-PFA, is incomparable with the class of sets accepted by two-dimensional alternating finite automata. We then show that 2-PFA is not closed under row catenation, column catenation, row +, and column + operations in Siromoney et al. (G, Siromoney, R. Siromoney, K, Krithivasan, Inform. and Control 22 (1973) 447), (C) 1998 Elsevier Science Inc. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0020-0255(98)00008-5 | Inf. Sci. |
Keywords | Field | DocType |
two-dimensional probabilistic finite automaton,finite automata,closure property,error probability | Quantum finite automata,Discrete mathematics,Automata theory,Closure (mathematics),Finite-state machine,Catenation,Probabilistic logic,Bounded error,Mathematics,ω-automaton | Journal |
Volume | Issue | ISSN |
110 | 3-4 | 0020-0255 |
Citations | PageRank | References |
5 | 0.46 | 12 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tokio Okazaki | 1 | 16 | 3.59 |
| Lan Zhang | 2 | 6 | 1.53 |
| Katsushi Inoue | 3 | 515 | 74.43 |
| Akira Ito | 4 | 10 | 1.60 |
| Yue Wang | 5 | 34 | 9.08 |