The paper is devoted to the problem of solving equations over щ-languages. Similar to formal languages, a solvable equation over щ-languages has the largest solution and the formula of the largest solution is similar to that for formal languages
Download file
Counter downloads: 61
- Title SOLVING PARALLEL EQUATIONS OVERщ-LANGUAGES
- Headline SOLVING PARALLEL EQUATIONS OVERщ-LANGUAGES
- Publesher
Tomsk State University - Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 2(8)
- Date:
- DOI
Keywords
автоматные уравнения, параллельная композиция щ-языков, уравнения для щ-языков, условие Бюхи, automata equations, parallel composition of щ-languages, equations over щ-languages, Bьchi automataAuthors
References
Yevtushenko N. V., Villa T., Brayton R. K., et al. Solution of Parallel Language Equations for Logic Synthesis // Proceedings of ICCAD 2001, San Jose. 2001. P. 103-110.
Wang G., Mishchenko A., Brayton R. K., et al. Sequential synthesis with co-Buchi specifications // ERL Technical Report, EECS Dept., UC Berkeley, April 2006. 6 p.
Thistle J. G., Wonham W. M. Supervision of infinte behavior of discrete-event systems // SIAM, Control and Optimization. 1994. V.32. No. 4. P. 1098-1113.
Buchi J. R. On a decision method in restricted second order arithmetic // Z. Math. Logik Grundlag. Math. 1960. P. 66-92.
Бушков В. Г., Евтушенко Н. В. Решение параллельных уравнений для щ-регулярных языков // Прикладная дискретная математика. Приложение. 2009. №1. С. 6-7.
Трахтенброт Б. А., Барздинь Я. М. Конечные автоматы (поведение и синтез). М.: Наука, 1970. 400 с.
Mukund M. Finite-state automata on infinite inputs // Tutorial talk, NSTCS 6, Banasthali, Rajasthan, India, August 1996. 32 p.
Хопкрофт Д., Мотвани Р., Ульман Д. Введение в теорию автоматов, языков и вычислений. М.: Вильямс, 2008. 528 с.
SOLVING PARALLEL EQUATIONS OVERщ-LANGUAGES | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2010. № 2(8).
Download full-text version
Download fileCounter downloads: 221