State Complexity of Basic Operations on Finite Languages-Reference-Cited by-同舟云学术

State Complexity of Basic Operations on Finite Languages

Published:2001 Issue: Volume: Page:60-70
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Câmpeanu C.,Culik K.,Salomaa Kai,Yu Sheng

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45526-4_6

Reference11 articles.

1. J.A. Brzozowski, “Canonical regular expressions and minimal state graphs for definite events”, Mathematical Theory of Automata, vol. 12 of MRI Symposia Series, Polytechnic Press, NY, 1962, 529–561.

2. C. Câmpeanu, “Regular languages and programming languages”, Revue Roumaine de Linguistique-CLTA, 23 (1986), 7–10.

3. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison Wesley (1979), Reading, Mass.

4. E. Leiss, “Succinct representation of regular languages by boolean automata”, Theoretical Computer Science 13 (1981) 323–330.

5. A. Salomaa, Theory of Automata, Pergamon Press (1969), Oxford.

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

1. Operational State Complexity of Block Languages;Electronic Proceedings in Theoretical Computer Science;2024-09-11

2. Operational Complexity in Subregular Classes;Implementation and Application of Automata;2023

3. State Complexity of Finite Partial Languages;Descriptional Complexity of Formal Systems;2022

4. Hot Current Topics of Descriptional Complexity;IFIP Advances in Information and Communication Technology;2021

5. Operations on Permutation Automata;Developments in Language Theory;2020