The pushdown automata are introduced by using the method of semirings and the tools from linear algebra. 文章介绍半环代数理论,讨论了下推自动机,在下推自动机概念的基础上给出了其在半环上的定义,特别是下推转换矩阵的引入,使下推自动机的行为和半环代数理论上的等式建立了联系。 更多例句>> 补充...
It is also shown that the equivalence of two deterministic pushdown transducers whose underlying DPDA's are synchronized can be tested.doi:10.1007/BF00288472Karel CulikJuhani Karhum?kiSpringer-VerlagActa InformaticaCulik II, K., Karhumäki, J.: Synchronizable deterministic pushdown automata and the ...
The notion of the DCFL is closely related to thedeterministic pushdown automaton(DPDA). It is where the language power of apushdown automatonis reduced if we make it deterministic; the pushdown automaton becomes unable to choose between different state transition alternatives and as a consequence ca...
Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an input alphabet with 2(n-1) elements. In this paper, we ...
it is decidable whether an arbitrary context-free language is included in the language accepted by a superdeterministic pushdown store automaton by final state and empty store, inclusion is undecidable for languages accepted by final state or accept mode by superdeterministic pushdown store automata. ...
Deterministic PDA’s Closure properties of DCFL’s Complementing DPDA’s Outline 1 Deterministic PDA’s 2 Closure properties of DCFL’s 3 Complementing DPDA’s Deterministic PDA’s Closure properties of DCFL’s Complementing DPDA’s Deterministic PDA’s ...
The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata A deterministic pushdown automaton (dpda) is described as finite-turn if there is a bound on the number of times the direction of the stack movement can change in the set of all derivations from the starting configurat...
Deterministic pushdown automatasimulationcomplexity(p, q)dpda A is the deterministic pushdown automaton with p two:way and q one-way heads. The behaviour of A can be described in terms of its sutface configurations (short configurations). By configuration we mean surface configuration in the sense...
pushdown automataω-automataparity indexThe article surveys some decidability results concerning simplification problems for DPDAs on infinite words (ω-DPDAs). We summarize some recent results on the regularity problem, which asks for a givenω-DPDA, whether its language can also be accepted by a...
We propose a new class of non-real-time deterministic pushdown automata (dpda's), named dpda's having the weak segmental property ( WSP ), and show that the equivalence problem is solvable for two dpda's, one of which is in this class. The equivalence checking algorithm to prove this ...