Alexander Okhotin

发表

Unambiguous Conjunctive Grammars over a One-Letter Alphabet

Artur Jez, Alexander Okhotin, 2013, Developments in Language Theory.

Input-driven pushdown automata: nondeterminism and unambiguity

Alexander Okhotin, Kai Salomaa, 2013, NCMA.

A Simple P-Complete Problem and Its Representations by Language Equations

Alexander Okhotin, 2007, MCU.

Conjunctive Grammars and Systems of Language Equations

Alexander Okhotin, 2004, Programming and Computer Software.

Linear-space recognition for grammars with contexts

Alexander Okhotin, Mikhail Barash, A. Okhotin, 2017, Theor. Comput. Sci..

Extensions of unification modulo ACUI

Alexander Okhotin, Franz Baader, Pavlos Marantidis, 2019, Mathematical Structures in Computer Science.

Language equations with complementation: Decision problems

Alexander Okhotin, Oksana Yakimova, A. Okhotin, 2007, Theor. Comput. Sci..

On the State Complexity of Scattered Substrings and Superstrings

Alexander Okhotin, A. Okhotin, 2010, Fundam. Informaticae.

State complexity of operations on two-way finite automata over a unary alphabet

Alexander Okhotin, Michal Kunc, 2012, Theor. Comput. Sci..

Unambiguous finite automata over a unary alphabet

Alexander Okhotin, 2012, Inf. Comput..

Parsing Unary Boolean Grammars Using Online Convolution

Alexander Okhotin, Christian Reitwießner, 2010, Advances and Applications of Automata on Words and Trees.

Language Equations with Symmetric Difference

Alexander Okhotin, 2012, Fundam. Informaticae.

Formal Languages over GF(2)

Alexander Okhotin, Ekaterina Bakinova, Artem Basharin, 2018, LATA.

Efficient automaton-based recognition for linear conjunctive languages

Alexander Okhotin, 2002, CIAA'02.

State complexity of operations on input-driven pushdown automata

Alexander Okhotin, Kai Salomaa, 2017, J. Comput. Syst. Sci..

Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata

Alexander Okhotin, Viliam Geffert, 2014, MFCS.

On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars

Artur Jez, Alexander Okhotin, 2012, DCFS.

Homomorphisms Preserving Linear Conjunctive Languages

Alexander Okhotin, 2008, J. Autom. Lang. Comb..

Two-sided context specifications in formal grammars

Alexander Okhotin, Mikhail Barash, A. Okhotin, 2015, Theor. Comput. Sci..

State complexity of unambiguous operations on finite automata

Alexander Okhotin, Galina Jirásková, 2019, Theor. Comput. Sci..

Equations over sets of integers with addition only

Artur Jez, Alexander Okhotin, 2016, J. Comput. Syst. Sci..

On Equations over Sets of Numbers and Their Limitations

Alexander Okhotin, Tommi Lehtinen, 2009, Developments in Language Theory.

Further closure properties of input-driven pushdown automata

Alexander Okhotin, Kai Salomaa, 2019, Theor. Comput. Sci..

On a new family of automata

Alexander Okhotin, 2002 .

An overview of conjunctive grammars

Alexander Okhotin, 2003 .

Grammars with two-sided contexts

Alexander Okhotin, Mikhail Barash, A. Okhotin, 2014, AFL.

A characterization of the arithmetical hierarchy by language equations

Alexander Okhotin, A. Okhotin, 2005, Int. J. Found. Comput. Sci..

Conjunctive Categorial Grammars

Alexander Okhotin, Stepan Kuznetsov, A. Okhotin, 2017, MOL.

A linear conjunctive grammar for the circuit value problem

Alexander Okhotin, 2002 .

Descriptional Complexity of Unambiguous Nested Word Automata

Alexander Okhotin, Kai Salomaa, K. Salomaa, 2011, LATA.

Contextual Grammars with Uniform Sets of Trajectories

Alexander Okhotin, Kai Salomaa, 2005, Fundam. Informaticae.

Nondeterministic State Complexity of Positional Addition

Alexander Okhotin, Galina Jirásková, 2009, DCFS.

Edit Distance Neighbourhoods of Input-Driven Pushdown Automata

Alexander Okhotin, Kai Salomaa, 2017, CSR.

Approximate Unification in the Description Logic FL_0

Alexander Okhotin, Franz Baader, Pavlos Marantidis, 2016, JELIA.

On Equations over Sets of Numbers and their Limitations

Alexander Okhotin, Tommi Lehtinen, 2011, Int. J. Found. Comput. Sci..

Descriptional complexity of formal systems : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, proceedings

Alexander Okhotin, Juhani Karhumäki, Helmut Jürgensen, 2014 .

State complexity of halting, returning and reversible graph-walking automata pdf

Alexander Okhotin, Olga Martynova, 2020, ArXiv.

Unambiguous conjunctive grammars over a one-symbol alphabet

Artur Jez, Alexander Okhotin, 2017, Theor. Comput. Sci..

Descriptional Complexity of Formal Systems

Alexander Okhotin, Juhani Karhumäki, Helmut Jürgensen, 2016, Theor. Comput. Sci..

State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet

Alexander Okhotin, Michal Kunc, 2011, DCFS.

LR Parsing for Boolean Grammars

Alexander Okhotin, A. Okhotin, 2005, Developments in Language Theory.

Defining Contexts in Context-Free Grammars

Alexander Okhotin, Mikhail Barash, A. Okhotin, 2012, LATA.

On the equivalence of linear conjunctive grammars and trellis automata

Alexander Okhotin, A. Okhotin, 2004, RAIRO Theor. Informatics Appl..

Improved Normal Form for Grammars with One-Sided Contexts

Alexander Okhotin, 2013, DCFS.

Whale calf, a parser generator for conjunctive grammars

Alexander Okhotin, A. Okhotin, 2002, CIAA'02.

Language Equations with Symmetric Difference

Alexander Okhotin, 2006, CSR.

On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages

Alexander Okhotin, Juhani Karhumäki, 2014, Computing with New Resources.

Computational power of two stacks with restricted communication

Alexander Okhotin, Juhani Karhumäki, Michal Kunc, 2010, Inf. Comput..

Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

Artur Jez, Alexander Okhotin, 2007, CSR.

Univariate Equations Over Sets of Natural Numbers

Artur Jez, Alexander Okhotin, 2010, Fundam. Informaticae.

Enumeration of Context-Free Languages and Related Structures

Jeffrey Shallit, Michael Domaratzki, Alexander Okhotin, 2005, DCFS.

Complexity of input-driven pushdown automata

Alexander Okhotin, Kai Salomaa, K. Salomaa, 2014, SIGA.

State Complexity of the Quotient Operation on Input-Driven Pushdown Automata

Alexander Okhotin, Kai Salomaa, 2019, Int. J. Found. Comput. Sci..

Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints

Alexander Okhotin, Franz Baader, 2012, LPAR.

Edit distance neighbourhoods of input-driven pushdown automata

Alexander Okhotin, Kai Salomaa, 2019, Theor. Comput. Sci..

Generalized LR Parsing for Grammars with Contexts

Alexander Okhotin, Mikhail Barash, A. Okhotin, 2015, CSR.

State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages

Alexander Okhotin, Elizaveta Sazhneva, 2019, DCFS.

On Computational Universality in Language Equations

Alexander Okhotin, 2004, MCU.

Representing Hyper-arithmetical Sets by Equations over Sets of Integers

Artur Jez, Alexander Okhotin, 2011, Theory of Computing Systems.

Language Equations with Complementation

Alexander Okhotin, Oksana Yakimova, 2006, Developments in Language Theory.

Strict Language Inequalities and Their Decision Problems

Alexander Okhotin, A. Okhotin, 2005, MFCS.

On the Transformation of LL(k)-linear Grammars to LL(1)-linear

Alexander Okhotin, Ilya Olkhovsky, 2020, CSR.

A simple P-complete problem and its language-theoretic representations

Alexander Okhotin, 2011, Theor. Comput. Sci..

Conjunctive Grammars with Restricted Disjunction

Alexander Okhotin, Christian Reitwießner, 2009, SOFSEM.

On the closure properties of linear conjunctive languages

Alexander Okhotin, A. Okhotin, 2003, Theor. Comput. Sci..

Computing by commuting

Alexander Okhotin, Juhani Karhumäki, Michal Kunc, 2006, Theor. Comput. Sci..

Top-Down Parsing of Conjunctive Languages

Alexander Okhotin, 2002, Grammars.

Recursive descent parsing for Boolean grammars

Alexander Okhotin, A. Okhotin, 2007, Acta Informatica.

Cyclic Shift on Multi-component Grammars

Alexander Okhotin, Alexey Sorokin, 2020, LATA.

One-Visit Caterpillar Tree Automata

Michael Domaratzki, Alexander Okhotin, Kai Salomaa, 2002, Fundam. Informaticae.

Expressive Power of LL(k) Boolean Grammars

Alexander Okhotin, 2007, FCT.

Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

Artur Jez, Alexander Okhotin, 2008, Theory of Computing Systems.

Reversibility of computations in graph-walking automata

Alexander Okhotin, Michal Kunc, 2020, Inf. Comput..

On the expressive power of univariate equations over sets of natural numbers

Alexander Okhotin, Panos Rondogiannis, 2008, IFIP TCS.

State complexity of linear conjunctive languages

Alexander Okhotin, 2002, DCFS.

Boolean Grammars

Alexander Okhotin, A. Okhotin, 2003, Developments in Language Theory.

The dual of concatenation

Alexander Okhotin, A. Okhotin, 2005, Theor. Comput. Sci..

A preliminary report on generalized LR parsing for Boolean grammars

Alexander Okhotin, A. Okhotin, 2004 .

Efficient Automaton-Based Recognition For Linear Conjunctive Languages

Alexander Okhotin, 2003, Int. J. Found. Comput. Sci..

On the number of nonterminals in linear conjunctive grammars

Alexander Okhotin, A. Okhotin, 2004, Theor. Comput. Sci..

The hardest linear conjunctive language

Alexander Okhotin, 2003, Inf. Process. Lett..

State Complexity of Operations on Input-Driven Pushdown Automata

Alexander Okhotin, Kai Salomaa, 2011, MFCS.

Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata

Alexander Okhotin, Galina Jirásková, 2018, DLT.

Notes on Dual Concatenation

Alexander Okhotin, 2007, Int. J. Found. Comput. Sci..

State complexity of cyclic shift

Alexander Okhotin, Galina Jirásková, A. Okhotin, 2008, RAIRO Theor. Informatics Appl..

On Language Equations with One-sided Concatenation

Alexander Okhotin, Franz Baader, F. Baader, 2013, Fundam. Informaticae.

On the Computational Completeness of Equations over Sets of Natural Numbers

Artur Jez, Alexander Okhotin, 2008, ICALP.

Boolean grammars

Alexander Okhotin, 2004, Inf. Comput..

Representing a P-complete problem by small trellis automata

Alexander Okhotin, 2008, CSP.

Language equations with addition in positional notation

Alexander Okhotin, Artur Jeż, 2007 .

State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata

Alexander Okhotin, Michal Kunc, 2011, Fundam. Informaticae.

On the state complexity of operations on two-way finite automata

Alexander Okhotin, Galina Jirásková, 2017, Inf. Comput..

Conjunctive Grammars

Alexander Okhotin, A. Okhotin, 2001, J. Autom. Lang. Comb..

Linear grammars with one-sided contexts and their automaton representation

Alexander Okhotin, Mikhail Barash, 2015, RAIRO Theor. Informatics Appl..

Unambiguous Finite Automata over a Unary Alphabet

Alexander Okhotin, 2010, MFCS.

On the expressive power of univariate equations over sets of natural numbers

Alexander Okhotin, Panos Rondogiannis, 2012, Inf. Comput..

Automaton Representation of Linear Conjunctive Languages

Alexander Okhotin, 2002, Developments in Language Theory.

On stateless multihead automata: Hierarchies and the emptiness problem

Oscar H. Ibarra, Alexander Okhotin, Juhani Karhumäki, 2008, Theor. Comput. Sci..

Generalized Lr Parsing Algorithm for Boolean Grammars

Alexander Okhotin, A. Okhotin, 2006, Int. J. Found. Comput. Sci..

A Boolean grammar for a simple programming language

Alexander Okhotin, A. Okhotin, 2004 .

On the Expressive Power of GF(2)-Grammars

Alexander Okhotin, Vladislav Makarov, 2019, SOFSEM.

Linear Grammars with One-Sided Contexts and Their Automaton Representation

Alexander Okhotin, Mikhail Barash, 2014, LATIN.

Complexity of Equations over Sets of Natural Numbers

Artur Jez, Alexander Okhotin, 2009, Theory of Computing Systems.

Language and Automata Theory and Applications

Dana Shapira, Gerhard Goos, Juris Hartmanis, 2019, Lecture Notes in Computer Science.

Further Closure Properties of Input-Driven Pushdown Automata

Alexander Okhotin, Kai Salomaa, K. Salomaa, 2019, DCFS.

Least and Greatest Solutions of Equations over Sets of Integers

Artur Jez, Alexander Okhotin, 2010, MFCS.

Computational completeness of equations over sets of natural numbers

Artur Jez, Alexander Okhotin, 2014, Inf. Comput..

Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups

Alexander Okhotin, Michal Kunc, 2011, Developments in Language Theory.

Improved normal form for grammars with one-sided contexts

Alexander Okhotin, A. Okhotin, 2013, Theor. Comput. Sci..

An extension of recursive descent parsing for Boolean grammars

Alexander Okhotin, A. Okhotin, 2004 .

Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm

Alexander Okhotin, 2010, Developments in Language Theory.

Conjunctive and Boolean grammars: The true general case of the context-free grammars

Alexander Okhotin, A. Okhotin, 2013, Comput. Sci. Rev..

Parsing Boolean grammars over a one-letter alphabet using online convolution

Alexander Okhotin, Christian Reitwießner, 2012, Theor. Comput. Sci..

A Tale of Conjunctive Grammars

Alexander Okhotin, A. Okhotin, 2018, DLT.

Complexity of solutions of equations over sets of natural numbers

Artur Jez, Alexander Okhotin, 2008, STACS.

Unambiguous Boolean grammars

Alexander Okhotin, 2007, Inf. Comput..

Computational Universality in One-variable Language Equations

Alexander Okhotin, 2006, Fundam. Informaticae.

Homomorphisms Preserving Deterministic Context-Free Languages

Alexander Okhotin, Tommi Lehtinen, A. Okhotin, 2012, Int. J. Found. Comput. Sci..

Decision Problems for Language Equations with Boolean Operations

Alexander Okhotin, 2003, ICALP.

Descriptional Complexity of Input-Driven Pushdown Automata

Alexander Okhotin, Kai Salomaa, Xiaoxue Piao, 2012, Languages Alive.

On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars

Artur Jez, Alexander Okhotin, 2018, Fundam. Informaticae.

An 11-state trellis automaton for a P-complete language

Alexander Okhotin, 2008 .

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

Alexander Okhotin, Kai Salomaa, K. Salomaa, 2014, Developments in Language Theory.

State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages

Alexander Okhotin, Elizaveta Sazhneva, A. Okhotin, 2020, DCFS.

Conjunctive grammars with restricted disjunction

Alexander Okhotin, Christian Reitwießner, 2010, Theor. Comput. Sci..

On the State Complexity of Star of Union and Star of Intersection

Alexander Okhotin, Galina Jirásková, A. Okhotin, 2011, Fundam. Informaticae.

LR Parsing for Conjunctive Grammars

Alexander Okhotin, 2002, Grammars.

Descriptional complexity of unambiguous input-driven pushdown automata

Alexander Okhotin, Kai Salomaa, K. Salomaa, 2015, Theor. Comput. Sci..

Unresolved systems of language equations: Expressive power and decision problems

Alexander Okhotin, A. Okhotin, 2005, Theor. Comput. Sci..

Non-erasing Variants of the Chomsky-Schützenberger Theorem

Alexander Okhotin, A. Okhotin, 2012, Developments in Language Theory.

Homomorphisms Preserving Deterministic Context-Free Languages

Alexander Okhotin, Tommi Lehtinen, 2013, Int. J. Found. Comput. Sci..

Graph-Walking Automata: From Whence They Come, and Whither They are Bound

Alexander Okhotin, 2019, CIAA.

State Complexity of Unambiguous Operations on Deterministic Finite Automata

Alexander Okhotin, Galina Jirásková, 2018, DCFS.

Expressive power of LL(k) Boolean grammars

Alexander Okhotin, 2011, Theor. Comput. Sci..

Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts

Alexander Okhotin, Mikhail Barash, A. Okhotin, 2017, Theory of Computing Systems.

The hardest language for grammars with context operators pdf

Alexander Okhotin, Mikhail Mrykhin, 2020, ArXiv.

Parsing by matrix multiplication generalized to Boolean grammars

Alexander Okhotin, 2014, Theor. Comput. Sci..

Nine Open Problems on Conjunctive and Boolean Grammars

Alexander Okhotin, 2007, Bull. EATCS.

Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages

Alexander Okhotin, 2011, SOFSEM.

Hardest languages for conjunctive and Boolean grammars

Alexander Okhotin, 2019, Inf. Comput..

The Quotient Operation on Input-Driven Pushdown Automata

Alexander Okhotin, Kai Salomaa, 2017, DCFS.

The Hardest Language for Conjunctive Grammars

Alexander Okhotin, 2016, CSR.

Least and greatest solutions of equations over sets of integers

Artur Jez, Alexander Okhotin, 2016, Theor. Comput. Sci..

On equations over sets of integers

Alexander Okhotin, Artur Je.z, 2010 .

On Stateless Multihead Automata: Hierarchies and the Emptiness Problem

Oscar H. Ibarra, Alexander Okhotin, Juhani Karhumäki, 2008, LATIN.

One-Nonterminal Conjunctive Grammars over a Unary Alphabet

Artur Jez, Alexander Okhotin, 2011, Theory of Computing Systems.

Reversibility of Computations in Graph-Walking Automata

Alexander Okhotin, Michal Kunc, 2013, MFCS.

Equations over Sets of Natural Numbers with Addition Only

Artur Jez, Alexander Okhotin, Artur Jeż, 2009, STACS.

State complexity of power

Michael Domaratzki, Alexander Okhotin, M. Domaratzki, 2009, Theor. Comput. Sci..

Language equations with complementation: Expressive power

Alexander Okhotin, Oksana Yakimova, 2012, Theor. Comput. Sci..

Longer Shortest Strings in Two-Way Finite Automata

Alexander Okhotin, Stanislav Krymski, 2020, DCFS.

Boolean grammars: expressive power and parsing algorithms

Alexander Okhotin, Kai Salomaa, 2005 .

On the State Complexity of Operations on Two-Way Finite Automata

Alexander Okhotin, Galina Jirásková, 2008, Developments in Language Theory.

Input-driven languages are linear conjunctive

Alexander Okhotin, A. Okhotin, 2016, Theor. Comput. Sci..

An overview of conjunctive grammars, Formal Language Theory Column

Alexander Okhotin, 2003, Bull. EATCS.

Computational and Proof Complexity of Partial String Avoidability

Alexander Okhotin, Dmitry Itsykson, Vsevolod Oparin, 2021, MFCS.

Representing recursively enumerable languages by iterated deletion

Michael Domaratzki, Alexander Okhotin, M. Domaratzki, 2004, Theor. Comput. Sci..

A recognition and parsing algorithm for arbitrary conjunctive grammars

Alexander Okhotin, 2003, Theor. Comput. Sci..

The Dual of Concatenation

Alexander Okhotin, 2004, MFCS.

Describing the syntax of programming languages using conjunctive and Boolean grammars pdf

Alexander Okhotin, A. Okhotin, 2020, ArXiv.

Preface

Alexander Okhotin, Jeffrey Shallit, 2018, Inf. Comput..

An extension of context-free grammars with one-sided context specifications

Alexander Okhotin, Mikhail Barash, A. Okhotin, 2014, Inf. Comput..

One-Nonterminal Conjunctive Grammars over a Unary Alphabet

Artur Jez, Alexander Okhotin, 2009, CSR.

On language equations with concatenation and various sets of Boolean operations

Alexander Okhotin, 2015, RAIRO Theor. Informatics Appl..

Underlying Principles and Recurring Ideas of Formal Grammars

Alexander Okhotin, A. Okhotin, 2018, LATA.

Communication of Two Stacks and Rewriting

Alexander Okhotin, Juhani Karhumäki, Michal Kunc, 2006, ICALP.

One-way simulation of two-way finite automata over small alphabets

Alexander Okhotin, Viliam Geffert, 2013, NCMA.

Boolean Grammars and GSM Mappings

Alexander Okhotin, Tommi Lehtinen, 2010, Int. J. Found. Comput. Sci..

On Language Equations XXK = XXL and XM = N over a Unary Alphabet

Alexander Okhotin, Tommi Lehtinen, 2010, Developments in Language Theory.

Decision problems for language equations

Alexander Okhotin, A. Okhotin, 2010, J. Comput. Syst. Sci..

On the Length of Shortest Strings Accepted by Two-Way Finite Automata

Alexander Okhotin, Egor Dobronravov, Nikita Dobronravov, 2019, DLT.

On equations over sets of integers

Artur Jez, Alexander Okhotin, 2010, STACS.

Input-driven automata on well-nested infinite strings: automata-theoretic and topological properties pdf

Alexander Okhotin, Victor L. Selivanov, 2020, ArXiv.

Rational index of bounded-oscillation languages pdf

Alexander Okhotin, Semyon Grigorev, Ekaterina Shemetova, 2020, ArXiv.

Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets

Alexander Okhotin, Viliam Geffert, 2021, DCFS.

On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata

Alexander Okhotin, Semyon Petrov, 2021, LATA.

The Hardest LL(k) Language

Alexander Okhotin, Mikhail Mrykhin, 2021, DLT.

State complexity of GF(2)-operations on unary languages

Alexander Okhotin, Elizaveta Sazhneva, 2021 .

Input-Driven Pushdown Automata on Well-Nested Infinite Strings

Alexander Okhotin, Victor L. Selivanov, 2021, CSR.

On Hardest Languages for One-Dimensional Cellular Automata

Alexander Okhotin, Mikhail Mrykhin, 2021, LATA.

On the Length of Shortest Strings Accepted by Two-way Finite Automata

Alexander Okhotin, Egor Dobronravov, Nikita Dobronravov, 2021, Fundam. Informaticae.

Homomorphisms on graph-walking automata pdf

Alexander Okhotin, Olga Martynova, 2021, ArXiv.

Computational and Proof Complexity of Partial String Avoidability

Alexander Okhotin, Dmitry Itsykson, Vsevolod Oparin, 2021, ACM Trans. Comput. Theory.

State Complexity of Union and Intersection on Graph-Walking Automata

Alexander Okhotin, Olga Martynova, 2021, DCFS.

On the determinization of event-clock input-driven pushdown automata pdf

Mizuhito Ogawa, Alexander Okhotin, 2021, ArXiv.

Lower Bounds for Graph-Walking Automata

Alexander Okhotin, Olga Martynova, 2021, STACS.

On LL(k) linear conjunctive grammars pdf

Alexander Okhotin, Ilya Olkhovsky, 2021, ArXiv.

Complexity of language equations with one-sided concatenation and all Boolean operations

Alexander Okhotin, Franz Baader, 2007 .

State Complexity of Linear Conjunctive Grammars.

Alexander Okhotin, 2004 .