On the Unmixedness Problems of Colored Pushdown Automata-Reference-Cited by-同舟云学术

On the Unmixedness Problems of Colored Pushdown Automata

Published:2023-03-01 Issue:3 Volume:E106.D Page:303-308
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

TAKAHASHI Yoshiaki¹,ITO Akira²

Affiliation:

1. National Institute of Technology, Oshima College

2. Graduate School of Science and Technology for Innovation, Yamaguchi University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E106.D/3/E106.D_2022FCP0005/_pdf

Reference16 articles.

1. [1] M. Sipser, “Introduction to the Theory of Computation,” PWS Publishing Company, 1997.

2. [2] J.E. Hopcroft, R. Motowani, and J.D. Ullman, “Introduction to Automaton Theory, Languages, and Computation,” 3rd Edition, Addison-Wesley Longman, 2007.

3. [3] J.E. Hopcroft and J.D. Ullman, “Introduction to Automata Theory, Languages, and Computation,” Addison-Wesley Publishing, 1979.

4. [4] J.V. Leeuwen, “Handbook of Theoretical Computer Science Volume B,” The MIT Press/Elsevier, 1990.

5. [5] J.R. Buchi, “Finite Automata, Their Algebras and Grammars,” Springer-Verlag New York, 1989.

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

1. Bilaterally Colored Finite Automata and their Regular Expressions with Application to Context-Free Parsing;2024 3rd International Conference on Computer Technologies (ICCTech);2024-02-01