Author:
Geffert Viliam,Pališínová Dominika,Szabari Alexander
Publisher
Springer International Publishing
Reference16 articles.
1. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2010)
2. Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)
3. Bruyère, V.: Maximal codes with bounded deciphering delay. Theoret. Comput. Sci. 84, 53–76 (1991)
4. Lecture Notes in Computer Science;K Čevorová,2013
5. Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inform. Comput. 205, 1652–1670 (2007)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. State complexity of binary coded regular languages;Theoretical Computer Science;2024-04
2. Binary Coded Unary Regular Languages;Implementation and Application of Automata;2023