Esko Ukkonen
- 1 Beeri, C. An improvement on Valiant's decisaon procedure for equivalence of determimstic finite- turn pushdovea automata. Theor. Compm. Sci. 3 (1976), 305--320.]]Google Scholar
- 2 FmeDttAN, E.P. F.~luivalence problems for deterministic context-free languages and monadlc recursion schemes, d. Comput. $),s~ Sci. 14 (19"/7), 344-359.]]Google Scholar
- 3 FmBDUAN, E.P. A note ors nonsiagular deterministic pushdown automata. Theor. Comput. Sei. 7 (1978), 333-339.]]Google Scholar
- 4 Fmet~M~, E.P., AlqD OIL~IBACH, S.A.Superdeterministic DPDAs: The method of accepting does affect decision problom~ ~ Co,nl, ut Syat. .~ci. 19 (1979), 79-117.]]Google Scholar
- 5 GtemAca, S.A. Linearity is polynomially decidable for realtime pushdown store automata, inf. Control 42 (1979), 27-37.]]Google Scholar
- 6 HARRISOn, M.A., AND HAVre., I.M. R.eal-time strict deterministic lmtgutg~~ SIAM $. Compuf. 1 (1972), 333-349.]]Google Scholar
- 7 HAaRISOb~, M.A., H^v~, I.M., ANO Y~ttuDAi, A. On equivalence of grammars throt~ transformation trees. Theor Comput. $ci. 9 (1979), 173-205.]]Google Scholar
- 8 HOPCI~.OFT, J.E., AND ULLMAN, LD. Introduction to Automala Theory, Languages and C~utation. Addison-Wesley, Reading, Mass., 1979.]]Google Scholar
- 9 KOR~JAK, A.J., AND HOPCROFT, J.E.Simple deterministic languages. Pro~, 7th Ann, IEEE Syrup. on Switching and Automata Theory, Berkeley, California, 1966, pp. 36-46.]]Google Scholar
- 10 LmN^, M. Two decidability results for determimmc pushdown automata. J. Comput. Syst, $ci. 18 (1979), 92--107.]]Google Scholar
- 11 OLSHANSKY, T., AUD PNUELI, A.A direct algorithm for checking equivalence of LL(k) grammars. Theor. Comput. Sc~ 4 (1977), 321-349.]]Google Scholar
- 12 OYAMAGUCHI, M., AND HONDA, N. The decidability of equivalence for deterministic statelegs pushdown automata. Inf. Control 38 (1978), 367-376.]]Google Scholar
- 13 OYAMAGUCHI, M., HONDA, N., AND It~AGArH, Y.The eqmvalence problem for real-time strict deterministic languages. Inf. Control 45 (1980), 90-115.]]Google Scholar
- 14 ROSl~NKRA~TZ, D.J, AND STEARNS, R.E. Properties ofdetermmistic top-down grammars. Inf. Control 17 (1970), 226-255]]Google Scholar
- 15 TANIGUCHI, K., AND KASAMI, T. A result on the equivalence problem for deterministic pushdown automata. ~ Comput. Syst. Sci. 13 (1976), 38-50.]]Google Scholar
- 16 VALIANT, L.G. Decismn procedures for familtes of deterministic pushdown automata, Ph.D. Dissertatlon, Computer Centre, Univ. of Warwick, 1973, Available as Tech. Pep. 7.]] Google Scholar
- 17 VALiXZCr, L.G.The equivalence problem for deterministic finite-turn pushdown automata. Inj: Control 25 (1974), 123-133.]]Google Scholar
Index Terms
- The equivalence problem for some non-real-time deterministic pushdown automata
Recommendations
Efficient determinization of visibly and height-deterministic pushdown automata
New algorithms for the determinization of nondeterministic visibly and nondeterministic real-time height-deterministic pushdown automata are presented. The algorithms improve the results of existing algorithms. They construct only accessible states and ...
Deterministic Pushdown Automata and Unary Languages
CIAA '08: Proceedings of the 13th international conference on Implementation and Applications of AutomataThe simulation of deterministic pushdown automata defined over a one letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be ...
Flip-pushdown automata: nondeterminism is better than determinism
DLT'03: Proceedings of the 7th international conference on Developments in language theoryFlip-pushdown automata are pushdown automata with the additional ability to flip or reverse its pushdown. We investigate deterministic and nondeterministic flip-pushdown automata accepting by final state or empty pushdown. In particular, for ...
Comments