Search

Your search keyword '"Volkov, Mikhail V."' showing total 42 results

Search Constraints

Start Over You searched for: Author "Volkov, Mikhail V." Remove constraint Author: "Volkov, Mikhail V." Publisher springer international publishing Remove constraint Publisher: springer international publishing
42 results on '"Volkov, Mikhail V."'

Search Results

1. Binary Completely Reachable Automata

3. Identities of the Kauffman Monoid

7. On the Interplay Between Babai and Černý’s Conjectures

8. Completely Reachable Automata

13. Closure Properties of Pattern Languages

14. Deterministic Set Automata

15. Embedding Finite and Infinite Words into Overlapping Tiles : (Short Paper)

16. Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word

17. From Algebra to Logic: There and Back Again The Story of a Hierarchy : (Invited Paper)

18. The Minimum Amount of Useful Space: New Results and New Directions

19. Minimal and Hyper-Minimal Biautomata : (Extended Abstract)

20. Debates with Small Transparent Quantum Verifiers

21. Measuring Communication in Automata Systems : (Invited Paper)

22. On k-Abelian Palindromic Rich and Poor Words

23. Input-Driven Pushdown Automata with Limited Nondeterminism : (Invited Paper)

24. Breadth-First Serialisation of Trees and Rational Languages : (Short Paper)

25. Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings

26. Eigenvalues and Transduction of Morphic Sequences

27. Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence

28. Aperiodic Tilings and Entropy

29. Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing

30. Synchronizing Automata with Random Inputs : (Short Paper)

31. k-Abelian Pattern Matching

32. Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars

33. Graph Spectral Properties of Deterministic Finite Automata : (Short Paper)

34. Scope-Bounded Pushdown Languages

35. Semisimple Synchronizing Automata and the Wedderburn-Artin Theory

36. How to Remove the Look-Ahead of Top-Down Tree Transducers

37. On Two Algorithmic Problems about Synchronizing Automata : (Short Paper)

38. On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States

39. Visibly Pushdown Transducers with Well-Nested Outputs

40. Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals

41. State Complexity of Deletion

42. On Automatic Transitive Graphs

Catalog

Books, media, physical & digital resources