Regular prefix relations
- 1 December 1984
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 17 (1) , 167-191
- https://doi.org/10.1007/bf01744439
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Alternation and the computational complexity of logic programsThe Journal of Logic Programming, 1984
- Algorithmic Program DebuggingPublished by MIT Press ,1983
- Abstract families of relationsJournal of Computer and System Sciences, 1971
- Characterizations of transductions defined by abstract families of transducersTheory of Computing Systems, 1971
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968
- Language identification in the limitInformation and Control, 1967
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961