The following publications are possibly variants of this publication:
- The hardest linear conjunctive languageAlexander Okhotin. ipl, 86(5):247-253, 2003. [doi]
- Automaton Representation of Linear Conjunctive LanguagesAlexander Okhotin. dlt 2003: 393-404 [doi]
- State complexity of linear conjunctive languagesAlexander Okhotin. dcfs 2002: 256-270
- On the closure properties of linear conjunctive languagesAlexander Okhotin. TCS, 1-3(299):663-685, 2003. [doi]
- Input-driven languages are linear conjunctiveAlexander Okhotin. TCS, 618:52-71, 2016. [doi]
- Homomorphisms Preserving Deterministic Context-Free LanguagesTommi Lehtinen, Alexander Okhotin. dlt 2012: 154-165 [doi]
- Homomorphisms Preserving Deterministic Context-Free LanguagesTommi Lehtinen, Alexander Okhotin. ijfcs, 24(7):1049-1066, 2013. [doi]
- Efficient Automaton-Based Recognition for Linear Conjunctive LanguagesAlexander Okhotin. wia 2003: 169-181 [doi]
- Efficient Automaton-Based Recognition For Linear Conjunctive LanguagesAlexander Okhotin. ijfcs, 14(6):1103-1116, 2003. [doi]
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free LanguagesAlexander Okhotin. sofsem 2011: 431-443 [doi]