Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)
On the regularity problem of SF-languages generated by minimal linear grammars
Unable to display preview. Download preview PDF.
- 1.Harju, T. and Penttonen, M., Some decidability problems of sentential forms, Intern. J. Computer Math. 7 (1979) 95–107.Google Scholar
- 2.Hashiguchi, K., A decision procedure for the order of regular events, Theoretical Computer Science 8 (1979) 69–72.Google Scholar
- 3.Salomaa, A., Comparative decision problems between sequential and parallell rewriting, Proc. Intern. Symp. Uniformly Structured Automata and Logic, Tokyo (1975).Google Scholar
- 4.Simon, I., Locally finite semigroups and limited subsets of a free monoid, a manuscript (1978).Google Scholar
© Springer-Verlag Berlin Heidelberg 1981