Hard sets method and semilinear reservoir method with applications

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

Volumn 1099, Issue , 1996, Pages 219-231

  Lisovik, Leonid P ^a  

^a TARAS SHEVCHENKO NATIONAL UNIVERSITY OF KYIV   (Ukraine)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; FORMAL LANGUAGES;

EQUIVALENCE PROBLEM; FORMAL LANGUAGE THEORY; SEMILINEAR;

AUTOMATA THEORY;

EID: 21344458111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_130     Document Type: Conference Paper

References (48)

1. K. Culik II, New technique for proving the decidability of equivalence problems, Theoret. Comput. Sei. 71 (1990) 29-45.
2. T. Harju and J. Karhumäki, The equivalence problem of multitape finite automata, Theoret. Comput. Sei. 78 (1991) 347-355.
3. L. Lisovik, The equivalence problem for finite-valued automata over semigroups, Kibernetika 4(1979) 24-27.
4. L. Lisovik, The equivalence problem for transducers over labeled trees, Dokladu of Ukrainian Acad. Sei. 6(1980) 77-79.
5. L. Lisovik, Metalinear schemes with individual constants, Ρrogrammirovanie 2 (1985) 29-38.
6. S. Garland and D. Luckham, Program schemes, recursion schemes and formal languages (Report, California Univ., Los Angeles, 1971).
7. S. Ginsburg, The mathematical theory of context-free languages (McGraw-Hill, New York, 1966).
8. L. Lisovik, To the equivalence problem for transducers over Σ-trees with finite-turned counters, Kibernetika, 5(1984) 19-24.
9. L. Lisovik, Metalinear recursive schemes over labeled trees, Program-mirovanie 5(1983) 13-22.
10. L. Lisovik, Hard sets and finite coverings of semigroup, Kibernetika, 1(1980) 12-16.
11. L. Lisovik, The sets definable in the theories of commutative semigroup, Dokladu of Ukrainian Acad. Sei. 8(1981) 80-83.
12. A. Aho and J.U. Uman, The theory of parsing, translation and compiling (Prentice-Hall, Englewood Cliffs, N.Y. 1972).
13. M. Schützenberger, Sur les relations rationnelles entre monoides libres, Theoret. Comput. Sei. 3(1976) 243-259.
14. O. Ibarra, The unsolvability of the equivalence problem for ε-free NGSM's with unary input (output) alphabet and applications, SIAM J.Comput. 4(1978) 524-532.
15. L. Lisovik, The identity problems of regular events over Cartesian product of free and cyclic semigroup, Dokladu of Ukrainian Acad. Sei. 6(1979) 410-413.
16. L. Lisovik, On finite transducers over labeled trees and quasi-identities in free semigroup, Problems of cybernetics 40(1983) 19-42.
17. L. Lisovik, Quasi-correlations in free group and equivalence problems for transducers, Algebra and Logic 25(1986) 51-86.
18. A. Weber, A decomposition theorem for finite-valued transducers and an application to the equivalence problem (Interner bericht 1/88, Fächbereich Informatik, Universität Frankfurt, 1988) 29 p.
19. K. Culik II and J. Karhumäki, The equivalence problem for finite-valued transducers (on HDTOL languages) is decidable, Theoret. Comput. Sei. 47 (1986) 71-84.
20. M. Albert and J. Lawrence, A proof of Ehrenfeucht conjecture, Theoret. Comput. Sei. 41(1985) 121-123.
21. L. Lisovik, The problems of inclusion and ambiguity for regular events in semigroups, Discrete Mathematics 5(1993) 54-74.
22. L. Lisovik, The problem of inclusion and equivalence for program schemes and formal languages, Kibernetika and Systems Analysis (former Kibernetika) 2(1993) 62-73.
23. M. Oyamaguchi, N. Honda and Y. Inagaki, The equivalence problem for real-time strict deterministic languages, Inform, and Control 45(1980) 90-115.
24. L. Lisovik, On regular algebra of functionals over labeled trees, Kibernetika, 5(1985) 25-30.
25. L. Lisovik, On the problem of occurrence in to regular subsets in the free product of subgroup, Siberian Mathematical Journal 20(1979) No 4.
26. L. Lisovik and V. Red'ko, Regular events in semigroups, Problems of cybernetics, 37(1980) 155-184.
27. M. Taitslin, On elementary theories of commutative semigroups, Algebra and Logic, 5(1966) 55-89.
28. L. Lisovik, The lattice structure of semilinear sets and the context-freeness problem in class of bounded languages, The theory of languages and processors (collection), Inst, of Cybernetics, Ukrainian Acad. Sei., Kiev, 1974, 89-99.
29. L. Lisovik, About preserving the context-freeness under permutation letters of words. The theory of languages and processors (collection), Inst, of Cybernetics, Ukrainian Acad. Sei., Kiev, 1974, 78-88.
30. L. Lisovik, Commutative closure of context-free languages, Kibernetika, 4(1978) 23-28.
31. J.F. Perrot, Sur la fermeture commutative des c-langages, C.r. Acad. Aci. 265(1967) No 20.
32. H. Maurer, The solution of a problem by Ginsburg, Information Processing Lett. 1(1971) No 1.
33. T. Oshiba, On permuting letters of words in context-free languages, Inform, and Control 20(1972) No 5.
34. J. Beauquier, M. Blattner and M. Latteux, On commutative context-free languages, J. Comput. System Sei. 35(1987) 311-320.
35. Μ. Rabin, Definability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141(1969) 1-35.
36. W. Thomas, Automata on infinite objects, Handbook of Theoretical Computer Science, Vol. B, Elsevier Science Publishers B.V. (1990).
37. L. Lisovik, Σ-automata with finite-turned counters, Kibernetika 3(1988) 19-22.
38. L. Lisovik, On construction of singular theories of two successors with additional predicate, Algebra and Logic 23 (1984) 266-277.
39. C. Elgot and M. Rabin, Decidability and undecidability of extensions of second (first) order theory of (generalized) successor, J. Symbol. Logic 31 (1966) 169-181.
40. L. Lisovik, Semilinear sets and decidable problems, Mathematical questions of cybernetics 1 (1988) 201-222.
41. A. Weber, On the valuedness of finite transducers, Acta Informatica 27(1990) 749-780.
42. A. Weber, Decomposing finite - valued transducers and deciding their equivalence, SIAM J. Comput. 22(1993)175-202.
43. L. Lisovik, About equivalence of transducers on regular languages, Kibernetika and Systems Analysis 6(1995)158-159.
44. L. Lisovik, An undecidable problem for countable Markoff chains, Kibernetika 2(1991) 1-6.
45. A. Salomaa, Jewels of formal language theory (Russian translation, with, afterword by A.A.Muchnik and A.L.Semenov), Mir Publishers, Moskow, 1986.
46. J. Karhumäki, Problems and solutions, P97. Bulletin of the EATCS 25(1985)184-185.
47. Y. Maon, On the equivalence of some transductions involving letter to letter morphisms on regular languages, Acta Informatica 23(1986)585-596.
48. P. Turakainen, On some transducer equivalence problems for families of languages, Intern. J. Computer Math. 23(1988) 99-124