Factorization in Formal Languages
From MaRDI portal
Publication:3451092
DOI10.1007/978-3-319-21500-6_7zbMath1434.68232arXiv1503.06365OpenAlexW2104694786MaRDI QIDQ3451092
Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit
Publication date: 10 November 2015
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.06365
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata, Boolean matrices, and ultimate periodicity.
- Inverse star, borders, and palstars
- A Second Course in Formal Languages and Automata Theory
- On multiset decipherable codes (Corresp.)
- Nondeterministic Space is Closed under Complementation
- A note on multiset decipherable codes
- Deciding multiset decipherability
- The finest homophonic partition and related code concepts
- Multiset and set decipherable codes
This page was built for publication: Factorization in Formal Languages