The following pages link to Igor Litovsky (Q673631):
Displaying 29 items.
- Characterizations of rational \(\omega\)-languages by means of right congruences (Q673632) (← links)
- Prefix-free languages as \(\omega\)-generators (Q751290) (← links)
- (Q1095673) (redirect page) (← links)
- On generators of rational \(\omega\)-power languages (Q1095674) (← links)
- Finitely generated bi\(\omega\)-languages (Q1183567) (← links)
- Which finite monoids are syntactic monoids of rational \(\omega\)-languages (Q1198042) (← links)
- Stability for the zigzag submonoids (Q1208713) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← links)
- Finite acceptance of infinite words (Q1269902) (← links)
- On the recognition of families of graphs with local computations (Q1891139) (← links)
- (Q3974875) (← links)
- (Q3988810) (← links)
- Rebootable and suffix-closed $\omega $-power languages (Q3991292) (← links)
- On coding morphisms for zigzag codes (Q4032306) (← links)
- (Q4037327) (← links)
- Checking Global Graph Properties by Means of Local Computations: the Majority Problem (Q4222809) (← links)
- (Q4227130) (← links)
- (Q4273662) (← links)
- (Q4281656) (← links)
- (Q4311866) (← links)
- (Q4318902) (← links)
- Different local controls for graph relabeling systems (Q4327379) (← links)
- (Q4412131) (← links)
- A more efficient notion of zigzag stability (Q4717039) (← links)
- One-relation languages and code generators (Q5021106) (← links)
- Definitions and comparisons of local computations on graphs (Q5096849) (← links)
- On the minimization problem for ω-automata (Q5096909) (← links)
- Minimal generators of submonoids of $A^\infty $ (Q5203692) (← links)
- (Q5485975) (← links)
