I'll interpret the 'general case' as:
Find all pairs of positive integers $(a,b)$ such that $a.b\times\frac{a}{b}=1$ where $a.b$ means a concatenation of $a,b$ with a decimal dot in between.
I'll present an almost-proof of this in base 10.
Firstly, note that the condition is equivalent to $a.b=\frac{b}{a}$. Secondly, note that $a+1>a.b\geq a$ so $a+1>\frac{b}{a}\geq a$, that is, $b=a^2+r$ for some $r<a$. So our equation becomes $a.b=\frac{a^2+r}{a}$ which is the same as $0.b=\frac{r}{a}$, or $\frac{a^2+r}{10^k}=\frac{r}{a}$ for $10^k$ being the smallest power of $10$ (strictly) greater than $a^2+r$, which can be weakened to $10(a^2+r)\geq10^k$.
Therefore we want $a^3=(10^k-a)r$ so $10^k-a|a^3\iff 10^k-a|10^{3k}$. Since $a^2<10^k$ what we really want is for some $10^k-\text{small number}|10^{3k}$. Let $10^k-\text{small number}=2^x5^y$ (since it's a factor of a power of $10$). Then we want to find $x,y,k$ such that $10^k-10^{\frac{k}{2}}\leq2^x5^y\leq10^k$. If $(x,y)$ is a solution with $x,y>0$ then so is $(x-1,y-1)$ so if you do a bit of bounding and stuff*, the only solution with $x\neq1$ is $(1,0), k=1$ (this is kind of easy, if I'm right).
Thanks to Gareth for an idea for the next part, which may or may not work. I don't understand anything well enough to say anything so this part is pure guess and hope:
Otherwise, we want $10^k-10^{\frac{k}{2}}\leq5^y\leq10^k$ and that means that $\frac{\log5}{\log{10}}$ has a 'good' rational approximation. Now Baker's theorem may or may not rule this out as unfeasible, depending on what the theorem actually says. I can't work anything out reasonably at this point so I'll call it a proof and wrap up here.
Anybody solving the above will definitely earn my everlasting respect
Anyway, translating our results back to $a,b$, we find that if the yellow stuff is correct then $(a,b)=(2,5)$ is the only solution.
I'd just like to point out that if we were working in a base $p$ where $p$ is prime, then at the point $p^k-a|p^{3k}$ it's pretty obvious there are no solution where $a$ is small compared to $p^k$, so no solutions exist in prime bases.
I think a similar result holds true in bases of the form $p^x$, in that only finitely many solutions are possible (this shouldn't be too hard to prove after reading the above)
Lastly, in the 'any base' case, I think that there' a chance finitely many solution exist for each base.
*bounding and stuff: