Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Choffrut, Christian
and
Grigorieff, Serge
1999.
Jewels are Forever.
p.
59.
Rabinovich, Alexander
2005.
Composition Theorems for Generalized Sum and Recursively Defined Types.
Electronic Notes in Theoretical Computer Science,
Vol. 123,
Issue. ,
p.
209.
Rabinovich, Alexander
and
Thomas, Wolfgang
2006.
Computer Science Logic.
Vol. 4207,
Issue. ,
p.
562.
Carayol, Arnaud
and
Löding, Christof
2007.
Computer Science Logic.
Vol. 4646,
Issue. ,
p.
161.
Rabinovich, Alexander
2007.
On decidability of monadic logic of order over the naturals extended by monadic predicates.
Information and Computation,
Vol. 205,
Issue. 6,
p.
870.
Rabinovich, Alexander
and
Shomrat, Amit
2008.
Pillars of Computer Science.
Vol. 4800,
Issue. ,
p.
571.
Rabinovich, Alexander
and
Shomrat, Amit
2010.
Selection over classes of ordinals expanded by monadic predicates.
Annals of Pure and Applied Logic,
Vol. 161,
Issue. 8,
p.
1006.
Carayol, Arnaud
Löding, Christof
Niwinski, Damian
and
Walukiewicz, Igor
2010.
Choice functions and well-orderings over the infinite binary tree.
Open Mathematics,
Vol. 8,
Issue. 4,
Fratani, Séverine
2012.
Regular sets over extended tree structures.
Theoretical Computer Science,
Vol. 418,
Issue. ,
p.
48.
Rabinovich, Alexander
and
Rubin, Sasha
2012.
Interpretations in Trees with Countably Many Branches.
p.
551.
Idziaszek, Tomasz
Skrzypczak, Michał
and
Bojańczyk, Mikołaj
2016.
Regular Languages of Thin Trees.
Theory of Computing Systems,
Vol. 58,
Issue. 4,
p.
614.
Michielini, Vincent
2018.
Developments in Language Theory.
Vol. 11088,
Issue. ,
p.
516.
Fabiański, Grzegorz
Skrzypczak, Michał
and
Toruńczyk, Szymon
2020.
Uniformisations of Regular Relations Over Bi-Infinite Words.
p.
384.