Abstract family of acceptors

From Wikipedia, the free encyclopedia

An abstract family of acceptors (AFA) is a grouping of generalized acceptors. Informally, an acceptor is a device with a finite state control, a finite number of input symbols, and an internal store with a read and write function. Each acceptor has a start state and a set of accepting states. The device reads a sequence of symbols, transitioning from state to state for each input symbol. If the device ends in an accepting state, the device is said to accept the sequence of symbols. A family of acceptors is a set of acceptors with the same type of internal store. The study of AFA is part of AFL (abstract families of languages) theory. [1]

Contents

[edit] Formal definitions

[edit] AFA Schema

An AFA Schema is an ordered 4-tuple (Γ,I,f,g), where

  1. Γ and I are nonempty abstract sets.
  2. f is the write function: f : \Gamma^* \times I \rightarrow \Gamma^* \cup \{\empty\} (N.B. * is the Kleene star operation).
  3. g is the read function, a mapping from Γ * into the finite subsets of Γ * , such that g(ε) = {ε} and ε is in g(γ) if and only if γ = ε. (N.B. ε is the empty word).
  4. For each γ in g(Γ * ), there is an element 1γ in I satisfying f(γ',1γ) = γ' for all γ' such that γ is in g(γ').
  5. For each u in I, there exists a finite set Γu ⊆ Γ, such that if Γ1 ⊆ Γ, γ is in \Gamma_1^*, and f(\gamma,u) \ne \empty, then f(γ,u) is in (\Gamma_1 \cup \Gamma_u)^*.

[edit] Abstract family of acceptors

An abstract family of acceptors (AFA) is an ordered pair (\Omega, \mathcal{D}) such that:

  1. Ω is an ordered 6-tuple (K, Σ, Γ, I, f, g), where
    1. (Γ, I, f, g) is an AFA schema; and
    2. K and Σ are infinite abstract sets
  2. \mathcal{D} is the family of all acceptors D = (K1, Σ1, δ, q0, F), where
    1. K1 and Σ1 are finite subsets of K, and Σ respectively, F ⊆ K1, and q0 is in K1; and
    2. δ (called the transition function) is a mapping from K_1 \times (\Sigma_1 \cup \{ \epsilon \}) \times g(\Gamma^*) into the finite subsets of K_1 \times I such that the set GD = {γ | δ(q,a,γ) ≠ ø for some q and a} is finite.


For a given acceptor, let \vdash be the relation on K_1 \times \Sigma_1^* \times \Gamma^* defined by: For a in \Sigma_1 \cup \{ \epsilon \}, (p,aw,\gamma) \vdash (p',w,\gamma') if there exists a \overline{\gamma} and u such that \overline{\gamma} is in g(γ), (p',u) is in \delta(p,a,\overline{\gamma}) and f(γ,u) = γ'. Let \vdash^* denote the transitive closure of \vdash.


Let (\Omega, \mathcal{D}) be an AFA and D = (K1, Σ1, δ, q0, F) be in D. Define L(D) to be the set \{ w \in \Sigma_1^* | \exists q \in F . (q_0,w,\epsilon) \vdash^* (q,\epsilon,\epsilon)\}. For each subset \mathcal{E} of \mathcal{D}, let \mathcal{L}(\mathcal{E}) = \{L(D) | D \in \mathcal{E} \}.


Define Lf(D) to be the set \{ w \in \Sigma_1^* | \exists(q \in F)\exists(\gamma \in \Gamma^*) . (q_0,w,\epsilon) \vdash^* (q,\epsilon,\gamma)\}. For each subset \mathcal{E} of \mathcal{D}, let \mathcal{L}_f(\mathcal{E}) = \{L_f(D) | D \in \mathcal{E} \}.

[edit] Informal discussion

[edit] AFA Schema

An AFA schema defines a store or memory with read and write function. The symbols in Γ are called storage symbols and the symbols in I are called instructions. The write function f returns a new storage state given the current storage state and an instruction. The read function g returns the current state of memory. Condition (3) insures the empty storage configuration is distinct from other configurations. Condition (4) requires there be an identity instruction that allows the state of memory to remain unchanged while the acceptor changes state or advances the input. Condition (5) assures that the set of storage symbols for any given acceptor is finite.

[edit] Abstract family of acceptors

An AFA is the set of all acceptors over a given pair of state and input alphabets which have the same storage mechanism defined by a given AFA schema. The \vdash relation defines one step in the operation of an acceptor. Lf(D) is the set of words accepted by acceptor D by having the acceptor enter an accepting state. L(D) is the set of words accepted by acceptor D by having the acceptor simultaneously enter an accepting state and having an empty storage.

The abstract acceptors defined by AFA are generalizations of other types of acceptors (e.g. finite state automata, pushdown automata, etc.). They have a finite state control like other automata, but their internal storage may vary widely from the stacks and tapes used in classical automata.

[edit] Results from AFL theory

The main result from AFL theory is that a family of languages \mathcal{L} is a full AFL if and only if \mathcal{L} = \mathcal{L}(\mathcal{D}) for some AFA (\Omega, \mathcal{D}). Equally important is the result that \mathcal{L} is a full semi-AFL if and only if \mathcal{L} = \mathcal{L}_f(\mathcal{D}) for some AFA (\Omega, \mathcal{D}).

[edit] Origins

Seymour Ginsburg of the University of Southern California and Sheila Greibach of Harvard University first presented their AFL theory paper at the IEEE Eighth Annual Symposium on Switching and Automata Theory in 1967.[2]

[edit] References

  1. ^ Seymour Ginsburg, Algebraic and automata theoretic properties of formal languages, North-Holland, 1975, ISBN 0 7204 2506 9.
  2. ^ IEEE conference record of 1967 Eighth Annual Symposium on Switching and Automata Theory : papers presented at the Eighth Annual Symposium, University of Texas, October 18-20, 1967.