The following pages link to L. P. Lisovik (Q797276):
Displayed 50 items.
- Metalinear recursive schemas on marked trees (Q797277) (← links)
- A method of specification of fractal sets (Q1040399) (← links)
- Metalinear schemes with transfer of constants (Q1065538) (← links)
- Construction of decidable singular theories of two successor functions with an extra predicate (Q1079557) (← links)
- Program schemata over cyclic interpretations (Q1157150) (← links)
- Quasiidentities in a free semigroup (Q1159774) (← links)
- Another representation of finite transducers over real numbers (Q1264587) (← links)
- Deterministic acceptors for indexed languages (Q1280912) (← links)
- Equivalence problems for transducers with a bounded number of states (Q1280978) (← links)
- Real functions defined by transducers (Q1286281) (← links)
- Recognition of perfect labeled trees with regularity condition (Q1364096) (← links)
- Equivalence problem of mappings relative to languages (Q1364102) (← links)
- Fractal sets defined by finite transducers (Q1369615) (← links)
- Using macrotransducers to specify partial continuous operators in metric spaces (Q1375271) (← links)
- Macrotransducers and applicative systems for partially continuous functions (Q1407110) (← links)
- On descriptive systems (Q1407320) (← links)
- A class of functions computable by index grammars (Q1429059) (← links)
- Solvability problems for \(ND\)-systems (Q1592108) (← links)
- Application of finite transducers to the specification of mappings and fractal sets (Q1593866) (← links)
- Structured Turing machines (Q1780228) (← links)
- Properties of \(\Delta\)-functions (Q1814623) (← links)
- Equivalence of transducers relative to regular languages (Q1816023) (← links)
- Macrotransducers on labeled trees and partially continuous operators (Q1816067) (← links)
- Representation of linear functionals over partially continuous functions (Q1816357) (← links)
- Quasirelations in a free group and transformator equivalence problems (Q1820772) (← links)
- The equivalence problem for finite substitutions in a regular language (Q1840955) (← links)
- A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138) (← links)
- Problems of inclusion and equivalence for program schemata and formal languages (Q1895011) (← links)
- Axiomatic theory of partial continuous functions and the Peano curve (Q1895047) (← links)
- Finite transformers for construction of fractal curves (Q1905144) (← links)
- Decidability problems for meta-\(R\)-functions (Q1907768) (← links)
- One-to-one mappings defined by finite transformers (Q1922338) (← links)
- \(R^*\)-transformers and fractal curves (Q1974318) (← links)
- Language recognition by two-way deterministic pushdown automata (Q2571535) (← links)
- (Q2762520) (← links)
- (Q3197299) (← links)
- Minimal undecidable identity problem for finite-automaton mappings (Q3315002) (← links)
- (Q3332228) (← links)
- (Q3362118) (← links)
- (Q3363054) (← links)
- (Q3663528) (← links)
- (Q3694312) (← links)
- (Q3712310) (← links)
- Regular algebra of functionals of labeled trees (Q3742755) (← links)
- (Q3824386) (← links)
- Reversal-bounded multicounter ?-machines (Q3830987) (← links)
- (Q3852383) (← links)
- Generators of regular languages (Q3886888) (← links)
- (Q3891738) (← links)
- Equivalence problem for finitely ambiguous finite automata over semigroups (Q3904054) (← links)