Using acceptors as transducers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1660, Issue , 1999, Pages 133-148

  Nykänen, Matti ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY;

FINITE SET; TWO WAYS;

TRANSDUCERS;

EID: 84957665679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48057-9_12     Document Type: Conference Paper

References (17)

1. Abiteboul, S., Hull, R., and Vianu, V. Foundations of Databases. Addison- Wesley, 1995.
2. Garey, M., and Johnson, D. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
3. Ginsburg, S., and Wang, X. Pattern matching by rs-operations: Towards a unified approach to querying sequenced data (extended abstract). In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1992), pp. 293-300.
4. Grahne, G., and Nykänen, M. Safety, translation and evaluation of Alignment Calculus. In Advances in Databases and Information Systems (1997), Springer Electronic Workshops in Computing, pp. 295-304.
5. Grahne, G., Nykänen, M., and Ukkonen, E. Reasoning about strings in databases. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1994), pp. 303-312.
6. Harrison, M., and Ibarra, O. Multi-tape and multi-head pushdown automata. Information and Control 13 (1968), 433-470.
7. Hopcroft, J., and Ullman, J. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
8. Krishnamurthy, R., Ramakrishnan, R., and Shmueli, O. A framework for testing safety and effective computability. Journal of Computer and System Sciences 52 (1996), 100-124.
9. Mecca, G., and Bonner, A. Sequences, Datalog and transducers. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1995), pp. 23-35.
10. Nykänen, M. Querying String Databases with Modal Logic. PhD thesis, Department of Computer Science, University of Helsinki, Finland, 1997.
11. Rajlich, V. Absolutely parallel grammars and two-way finite-state transducers. Journal of Computer and System Sciences 6 (1972), 324-342.
12. Ramakhrisnan, R., Bancilhon, F., and Silberschatz, A. Safety of recursive Horn clauses with infinite relations (extended abstract). In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1987), pp. 328-339.
13. Russell, S., and Norvig, P. Artificial Intelligence: a Modern Approach. Prentice-Hall, 1995.
14. van Gelder, A. Deriving constraints among argument sizes in logic programs. Tech. Rep. UCSC-CRL-89-41, University of Califormia, Santa Cruz, 1989. Appears also in the Annals of Mathematics and Artificial Intelligence.
15. Weber, A. On the valuedness of finite transducers. Acta Informatica 27 (1990), 749-780.
16. Weber, A. On the lengths of values in a finite transducer. Acta Informatica 29 (1992), 663-687.
17. Wolper, P. Temporal logic can be more expressive. Information and Control 56 (1983), 72-99.