On a structural property in the state complexity of projected regular languages-Reference-Cited by-同舟云学术

On a structural property in the state complexity of projected regular languages

Published:2012-08 Issue: Volume:449 Page:93-105
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Jirásková Galina,Masopust Tomáš

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference37 articles.

1. Determination of finite automata accepting subregular languages;Bordihn;Theoret. Comput. Sci.,2009

2. O. Boutin, J. Komenda, T. Masopust, K. Schmidt, J.H. van Schuppen, Hierarchical control with partial observations: Sufficient conditions, in: Proc. of IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011, Orlando, USA, pp. 1817–1822.

3. O. Boutin, J.H. van Schuppen, On the control of the paint factory scale model, Technical Report MAC-1103, CWI, Amsterdam, 2011. [Online]. Available: http://oai.cwi.nl/oai/asset/18598/18598D.pdf.

4. Introduction to Discrete Event Systems;Cassandras,2008

5. Finite automata and unary languages;Chrobak;Theoret. Comput. Sci.,1986

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. State complexity bounds for projection, shuffle, union, intersection, up- and downward closure and interior on commutative regular languages;Information and Computation;2024-08

2. State complexity of binary coded regular languages;Theoretical Computer Science;2024-04

3. Verifying weak and strong k-step opacity in discrete-event systems;Automatica;2023-09

4. On Transformations among Opacity Notions;2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC);2022-10-09

5. State Complexity of Binary Coded Regular Languages;Descriptional Complexity of Formal Systems;2022