Harel, On the Power of Bounded Concurrency II: Pushdown Automata, Journal of the ACM, 41 (1994), 540–554. Hennie, Finite-State Models for Logical Machines, Wiley, New York, 1968. Head, Formal Language Theory and DNA: An Analysis of the Generative Capacity of Specific Recombinant Behaviors, Bull. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, 1978. Yu, Synchronization Expressions and Languages, Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, (1994), 257–264. Goeman, On Minimizing Cover Automata for Finite Languages in O(n log n) Time, Seventh International Conference on Implementation and Application of Automata,121–130. Yu, Constructions for Alternating Finite Automata, Intern. and Computer Sci., Kent State University, 1991.Ī. Fellah, Alternating Finite Automata and Related Problems, PhD Dissertation, Dept. Eilenberg, Automata, Languages, and Machines, Vol. Stockmeyer, A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata, SIAM Journal on Computing,19 (1990), 1011–1023. Harel, On the Power of Bounded Concurrency I: Finite Automata, Journal of the ACM, 41 (1994), 517–539.Ĭ. Rozenberg edited, The Book of Traces, World Scientific, 1995.ĭ. Kari, Image Compression Using Weighted Finite Automata, Computer and Graphics, 17, 3 (1993), 305–313. Harju, Splicing Semigroups of Dominoes and DNA, Discrete Applied Mathematics, 31 (1991), 261–277. Dube, Affine Automata and Related Techniques for Generation of Complex Images, Theoretical Computer Science, 116 (1993), 373–398. Dube, Rational and Affine Expressions for Image Description, Discrete Applied Mathematics, 41 (1993), 85–120. Ravikumar, Some Observations Concerning Alternating Turing Machines Using Small Space, Inform. Stockmeyer, Alternation, Journal of the ACM, 28 (1981), 114–133. Maurel, Automata Implementation, Third International Workshop on Implementing Automata, LNCS 1660, Springer, 1999.Ī.K. An extended version appeared in Theoretical Computer Science, 267 (2002), 3–16. Yu, Minimal Cover-Automata for Finite Languages, Proceedings of the Third International Workshop on Implementing Automata (WIA’98) 1998, 32–42. Yu, An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages, International Journal of Foundations of Computer Science, 13, 1 (2002), 83–97.Ĭ. Yoeli, Digital Networks, Prentice-Hall, Englewood Cliffs, 1976.Ĭ. Seger, Asynchronous Circuits, Springer-Verlog, New York, 1995. Leiss, On Equations for Regular Languages, Finite Automata, and Sequential Networks, Theoretical Computer Science, 10 (1980), 19–35. Morcrette, Compact Representation of Patterns by Finite Automata, Pixim 89: L’Image Numérique à Paris, André Gagalowicz, ed., Hermes, Paris, 1989, pp. Weijland, Process Algebra, Cambridge University Press, Cambridge, 1990. Ullman, Compilers - Principles, Techniques, and Tools, Addison-Wesley, Reading, 1986. 1, Prentice-Hall, Englewood Cliffs, 1972.Ī.V. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. \(F\) is the set of final states, a (possibly empty) subset of \(S\).įor both deterministic and non-deterministic FSMs, it is conventional to allow \(\delta\) to be a partial function, i.e. \(\delta (s,x)\) does not have to be defined for every combination of \(s\in S\) and \(x\in \Sigma\).A.V.\(\delta\) would return a set of states)
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |