Preview
Unable to display preview. Download preview PDF.
References
Harju, T. and Penttonen, M., Some decidability problems of sentential forms, Intern. J. Computer Math. 7 (1979) 95–107.
Hashiguchi, K., A decision procedure for the order of regular events, Theoretical Computer Science 8 (1979) 69–72.
Salomaa, A., Comparative decision problems between sequential and parallell rewriting, Proc. Intern. Symp. Uniformly Structured Automata and Logic, Tokyo (1975).
Simon, I., Locally finite semigroups and limited subsets of a free monoid, a manuscript (1978).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Linna, M. (1981). On the regularity problem of SF-languages generated by minimal linear grammars. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_27
Download citation
DOI: https://doi.org/10.1007/3-540-10854-8_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10854-2
Online ISBN: 978-3-540-38765-7
eBook Packages: Springer Book Archive