Direction Independent Context-Sensitive Grammars - H. C. M. Kleijn; Martti Penttonen; Grzegorz Rozenberg; Kai Salomaa (Inf. Control., 1984)

Alternating Bottom-Up Tree Recognisers. - Kai Salomaa (CAAP, 1986)

Yield-Languages Recognized by Alternating Tree Recognizers. - Kai Salomaa (RAIRO Theor. Informatics Appl., 1988)

Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. - Kai Salomaa (J. Comput. Syst. Sci., 1988)

Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers. - Kai Salomaa (FCT, 1989)

The Immortality Problem for LAG Systems. - Kai Salomaa; Sheng Yu 001 (Inf. Process. Lett., 1990)

Degrees of Nondeterminism for Pushdown Automata. - Kai Salomaa; Sheng Yu 001 (FCT, 1991)

Decidability of Confluence and Termination of Monadic Term Rewriting Systems. - Kai Salomaa (RTA, 1991)

Primary Types of Instances of the Post Correspondence Problem. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Bull. EATCS, 1991)

Decidability of Structural Equivalence of E0L Grammars. - Kai Salomaa; Sheng Yu 001 (Theor. Comput. Sci., 1991)

Obtaining Tight Upper Bounds for the State Complexities of DFA Operations. - Sheng Yu 001; Qingyu Zhuang; Kai Salomaa (ICCI, 1992)

Alternation Bounds for Tree Automata. - Kai Salomaa (Acta Cybern., 1992)

Confluence, ground confluence, and termination of monadic term rewriting systems. - Kai Salomaa (J. Inf. Process. Cybern., 1992)

Structural Equivalences and ET0L Grammars (Extended Abstract). - Kai Salomaa; Derick Wood; Sheng Yu 001 (FCT, 1993)

Inclusion is Undecidable for Pattern Languages. - Tao Jiang 001; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (ICALP, 1993)

Morphisms and rational tranducers. - Kai Salomaa; Sheng Yu 001 (Bull. EATCS, 1993)

Decidability of the Intercode Property. - Helmut Jürgensen; Kai Salomaa; Sheng Yu 001 (J. Inf. Process. Cybern., 1993)

Rediscovering Pushdown Machines. - Kai Salomaa; Derick Wood; Sheng Yu 001 (Results and Trends in Theoretical Computer Science, 1994)

Synchronization expressions and languages. - Lifu Guo; Kai Salomaa; Sheng Yu 001 (SPDP, 1994)

Pumping and Pushdown Machines. - Kai Salomaa; Derick Wood; Sheng Yu 001 (RAIRO Theor. Informatics Appl., 1994)

Measures of Nondeterminism for Pushdown Automata. - Kai Salomaa; Sheng Yu 001 (J. Comput. Syst. Sci., 1994)

Semantics of Trees. - Andrzej Ehrenfeucht; Grzegorz Rozenberg; Kai Salomaa (Math. Syst. Theory, 1994)

Transducers and the Decidability of Independence in Free Monoids. - Helmut Jürgensen; Kai Salomaa; Sheng Yu 001 (Theor. Comput. Sci., 1994)

Synchronized Tree Automata. - Kai Salomaa (Theor. Comput. Sci., 1994)

The State Complexities of Some Basic Operations on Regular Languages. - Sheng Yu 001; Qingyu Zhuang; Kai Salomaa (Theor. Comput. Sci., 1994)

Nondeterminism Degrees for Context-Free Languages. - Kai Salomaa; Sheng Yu 001 (Developments in Language Theory, 1995)

Complexity of E0L Structural Equivalence. - Kai Salomaa; Derick Wood; Sheng Yu 001 (RAIRO Theor. Informatics Appl., 1995)

Decision Problems for Patterns. - Tao Jiang 001; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (J. Comput. Syst. Sci., 1995)

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. - Alexandru Mateescu; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (J. Univers. Comput. Sci., 1995)

P, NP and the Post Correspondence Problem - Alexandru Mateescu; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Inf. Comput., 1995)

EDTOL Structural Equivalence is Decidable. - Kai Salomaa; Sheng Yu 001 (DMTCS, 1996)

NFA to DFA Transformation for Finite Languages. - Kai Salomaa; Sheng Yu 001 (Workshop on Implementing Automata, 1996)

On Synchronization Languages. - Lifu Guo; Kai Salomaa; Sheng Yu 001 (Fundam. Informaticae, 1996)

Yield-Languages of Two-Way Pushdown Tree Automata. - Kai Salomaa (Inf. Process. Lett., 1996)

On the Modularity of Decidability of Completeness and Termination. - Kai Salomaa (J. Autom. Lang. Comb., 1996)

Decidability of Equivalence for Deterministic Synchronized Tree Automata. - Kai Salomaa (Theor. Comput. Sci., 1996)

Structural Equivalence and ET0L Grammars. - Kai Salomaa; Derick Wood; Sheng Yu 001 (Theor. Comput. Sci., 1996)

Block-Synchronization Context-Free Grammars. - Helmut Jürgensen; Kai Salomaa (Advances in Algorithms, Languages, and Complexity, 1997)

Rewriting Rules for Synchronization Languages. - Kai Salomaa; Sheng Yu 001 (Structures in Logic and Computer Science, 1997)

Decidability of fairness for context-free languages. - Alexandru Mateescu; Kai Salomaa; Sheng Yu 001 (Developments in Language Theory, 1997)

Hierarchies of synchronized and algebraic forests. - George Rahonis; Kai Salomaa (Developments in Language Theory, 1997)

Efficient Implementation of Regular Languages Using R-AFA. - Kai Salomaa; Xiuming Wu; Sheng Yu 001 (Workshop on Implementing Automata, 1997)

Semantics of Nonsequential Tree-Based Computation Schemes. - Andrzej Ehrenfeucht; Grzegorz Rozenberg; Kai Salomaa (Fundam. Informaticae, 1997)

NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets. - Kai Salomaa; Sheng Yu 001 (J. Autom. Lang. Comb., 1997)

Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. - Sandra Huerter; Kai Salomaa; Xiuming Wu; Sheng Yu 001 (Workshop on Implementing Automata, 1998)

On the Size of Stack and Synchronization Alphabets of Tree Automata. - George Rahonis; Kai Salomaa (Fundam. Informaticae, 1998)

Synchronization Expressions with Extended Join Operation. - Kai Salomaa; Sheng Yu 001 (Theor. Comput. Sci., 1998)

Synchronization Expressions: Characterization Results and Implementation. - Kai Salomaa; Sheng Yu 001 (Jewels are Forever, 1999)

Metric Lexical Analysis. - Cristian Calude; Kai Salomaa; Sheng Yu 001 (WIA, 1999)

State Complexity of Basic Operations on Finite Languages. - Cezar Câmpeanu; Karel Culík II; Kai Salomaa; Sheng Yu 001 (WIA, 1999)

Generalized Fairness and Context-Free Languages. - Kai Salomaa; Sheng Yu 001 (Acta Cybern., 1999)

Synchronization Expressions and Languages. - Kai Salomaa; Sheng Yu 001 (J. Univers. Comput. Sci., 1999)

State Complexity of Regular Languages: Finite versus Infinite. - Cezar Câmpeanu; Kai Salomaa; Sheng Yu 001 (Finite Versus Infinite, 2000)

On Fairness of Many-Dimensional Trajectories. - Alexandru Mateescu; Kai Salomaa; Sheng Yu 001 (J. Autom. Lang. Comb., 2000)

Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. - Kai Salomaa; Xiuming Wu; Sheng Yu 001 (Theor. Comput. Sci., 2000)

Alternating finite automata and star-free languages. - Kai Salomaa; Sheng Yu 001 (Theor. Comput. Sci., 2000)

Shuffle Quotient and Decompositions. - Cezar Câmpeanu; Kai Salomaa; Sándor Vágvölgyi (Developments in Language Theory, 2001)

A sharpening of the Parikh mapping. - Alexandru Mateescu; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (RAIRO Theor. Informatics Appl., 2001)

On the State Complexity of k-Entry Deterministic Finite Automata. - Markus Holzer 001; Kai Salomaa; Sheng Yu 001 (J. Autom. Lang. Comb., 2001)

Regex and Extended Regex. - Cezar Câmpeanu; Kai Salomaa; Sheng Yu 001 (CIAA, 2002)

One-Visit Caterpillar Tree Automata. - Alexander Okhotin; Kai Salomaa; Michael Domaratzki (Fundam. Informaticae, 2002)

Shuffle Decompositions of Regular Languages. - Cezar Câmpeanu; Kai Salomaa; Sándor Vágvölgyi (Int. J. Found. Comput. Sci., 2002)

Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. - Cezar Câmpeanu; Kai Salomaa; Sheng Yu 001 (J. Autom. Lang. Comb., 2002)

Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue. - Cristian Calude; Kai Salomaa; Sheng Yu 001 (J. Univers. Comput. Sci., 2002)

Additive Distances and Quasi-Distances Between Words. - Cristian Calude; Kai Salomaa; Sheng Yu 001 (J. Univers. Comput. Sci., 2002)

Decidability of EDT0L structural equivalence. - Kai Salomaa; Sheng Yu 001 (Theor. Comput. Sci., 2002)

A Formal Study Of Practical Regular Expressions. - Cezar Câmpeanu; Kai Salomaa; Sheng Yu 001 (Int. J. Found. Comput. Sci., 2003)

Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. - Kai Salomaa; Derick Wood (Theory Is Forever, 2004)

State Complexity of Shuffle on Trajectories. - Michael Domaratzki; Kai Salomaa (J. Autom. Lang. Comb., 2004)

Contextual Grammars with Uniform Sets of Trajectories. - Alexander Okhotin; Kai Salomaa (Fundam. Informaticae, 2005)

Restricted sets of trajectories and decidability of shuffle decompositions. - Michael Domaratzki; Kai Salomaa (Int. J. Found. Comput. Sci., 2005)

Preface. - Kai Salomaa; Sheng Yu 001 (Int. J. Found. Comput. Sci., 2005)

Decidability of trajectory-based equations. - Michael Domaratzki; Kai Salomaa (Theor. Comput. Sci., 2005)

Iterated TGR Languages: Membership Problem and Effective Closure Properties. - Ian McQuillan; Kai Salomaa; Mark Daley (COCOON, 2006)

Regular Approximations of Non-Regular Languages. - Brendan J. Cordy; Kai Salomaa (DCFS, 2006)

State Complexity of Catenation and Reversal Combined with Star. - Yuan Gao 001; Kai Salomaa; Sheng Yu 001 (DCFS, 2006)

State Complexity of Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (DCFS, 2006)

Prime Decompositions of Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Developments in Language Theory, 2006)

Interpreted Trajectories. - Michael Domaratzki; Grzegorz Rozenberg; Kai Salomaa (Fundam. Informaticae, 2006)

Codes defined by multiple sets of trajectories. - Michael Domaratzki; Kai Salomaa (Theor. Comput. Sci., 2006)

Descriptional Complexity of Nondeterministic Finite Automata. - Kai Salomaa (Developments in Language Theory, 2007)

Deterministic Caterpillar Expressions. - Kai Salomaa; Sheng Yu 001; Jinfeng Zan (CIAA, 2007)

Intercode Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Fundam. Informaticae, 2007)

State Complexity of Additive Weighted Finite Automata. - Kai Salomaa; Paul N. Schofield (Int. J. Found. Comput. Sci., 2007)

On the State Complexity of Combined Operations and their Estimation. - Kai Salomaa; Sheng Yu 001 (Int. J. Found. Comput. Sci., 2007)

An infinite hierarchy induced by depth synchronization. - Franziska Biegler; Ian McQuillan; Kai Salomaa (Theor. Comput. Sci., 2007)

On the existence of regular approximations. - Brendan J. Cordy; Kai Salomaa (Theor. Comput. Sci., 2007)

Transition complexity of language operations. - Michael Domaratzki; Kai Salomaa (Theor. Comput. Sci., 2007)

On the existence of prime decompositions. - Yo-Sub Han; Arto Salomaa; Kai Salomaa; Derick Wood; Sheng Yu 001 (Theor. Comput. Sci., 2007)

State complexity of combined operations. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Theor. Comput. Sci., 2007)

Watson-Crick automata: determinism and state complexity. - Elena Czeizler; Eugen Czeizler; Lila Kari; Kai Salomaa (DCFS, 2008)

State Complexity of Orthogonal Catenation. - Mark Daley; Michael Domaratzki; Kai Salomaa (DCFS, 2008)

Length Codes, Products of Languages and Primality. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (LATA, 2008)

Language Decompositions, Primality, and Trajectory-Based Operations. - Kai Salomaa (CIAA, 2008)

The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal. - Yuan Gao 001; Kai Salomaa; Sheng Yu 001 (Fundam. Informaticae, 2008)

State Complexity of Union and Intersection of Finite Languages. - Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2008)

Lower bounds for the transition complexity of NFAs. - Michael Domaratzki; Kai Salomaa (J. Comput. Syst. Sci., 2008)

Operational State Complexity of Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Automata, Formal Languages, and Related Topics, 2009)

A Cryptosystem Based on the Composition of Reversible Cellular Automata. - Adam Clarridge; Kai Salomaa (LATA, 2009)

State Complexity of Combined Operations for Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Sheng Yu 001 (LATA, 2009)

State Complexity of Nested Word Automata. - Kai Salomaa (LATA, 2009)

A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule. - Adam Clarridge; Kai Salomaa (CIAA, 2009)

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Fundam. Informaticae, 2009)

Variants of codes and indecomposable languages. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Inf. Comput., 2009)

On the synchronized derivation depth of context-free grammars. - Franziska Biegler; Kai Salomaa (Theor. Comput. Sci., 2009)

On the descriptional complexity of Watson-Crick automata. - Elena Czeizler; Eugen Czeizler; Lila Kari; Kai Salomaa (Theor. Comput. Sci., 2009)

State complexity of basic operations on suffix-free regular languages. - Yo-Sub Han; Kai Salomaa (Theor. Comput. Sci., 2009)

Nondeterministic state complexity of nested word automata. - Yo-Sub Han; Kai Salomaa (Theor. Comput. Sci., 2009)

Operational state complexity of nested word automata. - Xiaoxue Piao; Kai Salomaa (Theor. Comput. Sci., 2009)

Deciding determinism of caterpillar expressions. - Kai Salomaa; Sheng Yu 001; Jinfeng Zan (Theor. Comput. Sci., 2009)

Operational State Complexity of Deterministic Unranked Tree Automata - Xiaoxue Piao; Kai Salomaa (DCFS, 2010)

Transformations Between Different Types of Unranked Bottom-Up Tree Automata - Xiaoxue Piao; Kai Salomaa (DCFS, 2010)

Nondeterministic State Complexity for Suffix-Free Regular Languages - Yo-Sub Han; Kai Salomaa (DCFS, 2010)

Finite-State Complexity and the Size of Transducers - Cristian Calude; Kai Salomaa; Tania Roblot (DCFS, 2010)

An Improved Cellular Automata Based Algorithm for the 45-Convex Hull Problem. - Adam Clarridge; Kai Salomaa (J. Cell. Autom., 2010)

Orthogonal Concatenation: Language Equations and State Complexity. - Mark Daley; Michael Domaratzki; Kai Salomaa (J. Univers. Comput. Sci., 2010)

Analysis of a cellular automaton model for car traffic with a slow-to-stop rule. - Adam Clarridge; Kai Salomaa (Theor. Comput. Sci., 2010)

Tree Homomorphisms for Unranked Trees. - Xiaoxue Piao; Kai Salomaa; Sándor Vágvölgyi (AFL, 2011)

On Language Decompositions and Primality. - Michael Domaratzki; Kai Salomaa (Rainbow of Computer Science, 2011)

State Trade-Offs in Unranked Tree Automata. - Xiaoxue Piao; Kai Salomaa (DCFS, 2011)

Descriptional Complexity of Unambiguous Nested Word Automata. - Alexander Okhotin; Kai Salomaa (LATA, 2011)

Undecidability of the State Complexity of Composed Regular Operations. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (LATA, 2011)

Extended Watson-Crick L Systems with Regular Trigger Languages. - David Sears 001; Kai Salomaa (UC, 2011)

Transition Complexity of Incomplete DFAs. - Yuan Gao 001; Kai Salomaa; Sheng Yu 001 (Fundam. Informaticae, 2011)

Transformations Between Different Models of Unranked Bottom-Up Tree Automata. - Xiaoxue Piao; Kai Salomaa (Fundam. Informaticae, 2011)

Limitations of lower bound methods for deterministic nested word automata. - Kai Salomaa (Inf. Comput., 2011)

Preface. - Michael Domaratzki; Kai Salomaa (Int. J. Found. Comput. Sci., 2011)

Overlap-Free Languages and solid Codes. - Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2011)

Editorial: Computing with biomolecules. - Erzsébet Csuhaj-Varjú; Kai Salomaa (Nat. Comput., 2011)

Finite state complexity. - Cristian S. Calude; Kai Salomaa; Tania Roblot (Theor. Comput. Sci., 2011)

Descriptional Complexity of Input-Driven Pushdown Automata. - Alexander Okhotin; Xiaoxue Piao; Kai Salomaa (Languages Alive, 2012)

State Complexity of Kleene-Star Operations on Trees. - Xiaoxue Piao; Kai Salomaa (Computation, Physics and Beyond, 2012)

State Complexity and Limited Nondeterminism. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (DCFS, 2012)

State Complexity of Projection and Quotient on Unranked Trees. - Xiaoxue Piao; Kai Salomaa (DCFS, 2012)

Computing the Edit-Distance between a Regular Language and a Context-Free Language. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Developments in Language Theory, 2012)

A cellular automaton model for connectivity preserving deployment of mobile wireless sensors. - Salimur Choudhury; Kai Salomaa; Selim G. Akl (ICC, 2012)

Cellular automaton based algorithms for depth adjustment in underwater mobile sensor networks. - Salimur Choudhury; Kai Salomaa; Selim G. Akl (MASS Workshops, 2012)

Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks. - Salimur Choudhury; Kai Salomaa; Selim G. Akl (TPNC, 2012)

Energy efficient cellular automaton based algorithms for mobile wireless sensor networks. - Salimur Choudhury; Selim G. Akl; Kai Salomaa (WCNC, 2012)

In Memoriam Sheng Yu. - Yuan Gao 001; Kai Salomaa (CIAA, 2012)

Sheng Yu (1950-2012) In Memoriam. - Arto Salomaa; Kai Salomaa; Andrew L. Szilard (Fundam. Informaticae, 2012)

State-Size Hierarchy for Finite-State Complexity. - Cristian S. Calude; Kai Salomaa; Tania Roblot (Int. J. Found. Comput. Sci., 2012)

State Complexity of Finite Tree Width NFAs. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (J. Autom. Lang. Comb., 2012)

A Cellular Automaton Model for Wireless Sensor Networks. - Salimur Choudhury; Kai Salomaa; Selim G. Akl (J. Cell. Autom., 2012)

Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes. - David Sears 001; Kai Salomaa (Nat. Comput., 2012)

State complexity of the concatenation of regular tree languages. - Xiaoxue Piao; Kai Salomaa (Theor. Comput. Sci., 2012)

Lower bounds for the size of deterministic unranked tree automata. - Xiaoxue Piao; Kai Salomaa (Theor. Comput. Sci., 2012)

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Kai Salomaa (DCFS, 2013)

Comparisons between Measures of Nondeterminism on Finite Automata. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (DCFS, 2013)

Finite Nondeterminism vs. DFAs with Multiple Initial States. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (DCFS, 2013)

Input-driven pushdown automata: nondeterminism and unambiguity. - Alexander Okhotin; Kai Salomaa (NCMA, 2013)

Undecidability of state complexity. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Int. J. Comput. Math., 2013)

The Edit-Distance between a Regular Language and a Context-Free Language. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Int. J. Found. Comput. Sci., 2013)

Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012. - Arto Salomaa; Kai Salomaa; Andrew L. Szilard (Int. J. Found. Comput. Sci., 2013)

State Complexity of Combined Operations for Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Kai Salomaa; Sheng Yu 001 (Discrete Mathematics and Computer Science, 2014)

Cellular automata and Mobile Wireless Sensor Networks. - Salimur Choudhury; Kai Salomaa; Selim G. Akl (CCECE, 2014)

Computation Width and Deviation Number. - Daniel Goc; Kai Salomaa (DCFS, 2014)

State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (DCFS, 2014)

State Complexity of Deletion. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Developments in Language Theory, 2014)

Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper). - Alexander Okhotin; Kai Salomaa (Developments in Language Theory, 2014)

Top-Down Tree Edit-Distance of Regular Tree Languages. - Sang-Ki Ko; Yo-Sub Han; Kai Salomaa (LATA, 2014)

Unary NFAs with Limited Nondeterminism. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (SOFSEM, 2014)

Pseudo-inversion on Formal Languages. - Da-Jung Cho; Yo-Sub Han; Shin-Dong Kang; Hwee Kim; Sang-Ki Ko; Kai Salomaa (UCNC, 2014)

Nondeterministic State Complexity of Proportional Removals. - Daniel Goc; Alexandros Palioudakis; Kai Salomaa (Int. J. Found. Comput. Sci., 2014)

Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (J. Autom. Lang. Comb., 2014)

Cellular automaton-based algorithms for the dispersion of mobile wireless sensor networks. - Salimur Choudhury; Kai Salomaa; Selim G. Akl (Int. J. Parallel Emergent Distributed Syst., 2014)

Complexity of input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (SIGACT News, 2014)

On the Inverse Beacon Attraction Region of a Point. - Bahram Kouhestani; David Rappaport; Kai Salomaa (CCCG, 2015)

Nondeterministic Tree Width of Regular Languages. - Cezar Câmpeanu; Kai Salomaa (DCFS, 2015)

The State Complexity of Permutations on Finite Languages over Binary Alphabets. - Alexandros Palioudakis; Da-Jung Cho; Daniel Goc; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (DCFS, 2015)

Cellular automata and object monitoring in mobile wireless sensor networks. - Salimur Choudhury; Kai Salomaa; Selim G. Akl (WCNC, 2015)

State Complexity of Kleene-Star Operations on Regular Tree Languages. - Yo-Sub Han; Sang-Ki Ko; Xiaoxue Piao; Kai Salomaa (Acta Cybern., 2015)

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2015)

Cellular Automaton Based Localized Algorithms for Mobile Sensor Networks. - Salimur Choudhury; Kai Salomaa; Selim G. Akl (Int. J. Unconv. Comput., 2015)

Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (Int. J. Unconv. Comput., 2015)

Descriptional complexity of unambiguous input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (Theor. Comput. Sci., 2015)

The Length of the Beacon Attraction Trajectory. - Bahram Kouhestani; David Rappaport; Kai Salomaa (CCCG, 2016)

Outfix-Guided Insertion - (Extended Abstract). - Da-Jung Cho; Yo-Sub Han; Timothy Ng 001; Kai Salomaa (DLT, 2016)

CARRE: Cellular automaton based redundant readers elimination in RFID networks. - Nafiul Rashid; Salimur Choudhury; Kai Salomaa (ICC, 2016)

State complexity of deletion and bipolar deletion. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Acta Informatica, 2016)

Approximate matching between a context-free grammar and a finite-state automaton. - Sang-Ki Ko; Yo-Sub Han; Kai Salomaa (Inf. Comput., 2016)

State Complexity of Insertion. - Yo-Sub Han; Sang-Ki Ko; Timothy Ng 001; Kai Salomaa (Int. J. Found. Comput. Sci., 2016)

Duplications and Pseudo-Duplications. - Da-Jung Cho; Yo-Sub Han; Hwee Kim; Alexandros Palioudakis; Kai Salomaa (Int. J. Unconv. Comput., 2016)

Pseudo-inversion: closure properties and decidability. - Da-Jung Cho; Yo-Sub Han; Shin-Dong Kang; Hwee Kim; Sang-Ki Ko; Kai Salomaa (Nat. Comput., 2016)

State complexity of inversion operations. - Da-Jung Cho; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Theor. Comput. Sci., 2016)

Operational state complexity of unary NFAs with finite nondeterminism. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (Theor. Comput. Sci., 2016)

Quasi-Distances and Weighted Finite Automata. - Timothy Ng 001; David Rappaport; Kai Salomaa (The Role of Theory in Computer Science, 2017)

The Quotient Operation on Input-Driven Pushdown Automata. - Alexander Okhotin; Kai Salomaa (DCFS, 2017)

Relative Prefix Distance Between Languages. - Timothy Ng 001; David Rappaport; Kai Salomaa (DLT, 2017)

Ambiguity, Nondeterminism and State Complexity of Finite Automata. - Yo-Sub Han; Arto Salomaa; Kai Salomaa (Acta Cybern., 2017)

Report on the Magic in Science symposium. - Kai Salomaa; Andrew L. Szilard (Bull. EATCS, 2017)

State Complexity of k-Parallel Tree Concatenation. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Fundam. Informaticae, 2017)

Preface. - Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2017)

Worst Case Branching and Other Measures of Nondeterminism. - Alexandros Palioudakis; Kai Salomaa; Selim G. Akl (Int. J. Found. Comput. Sci., 2017)

State Complexity of Prefix Distance of Subregular Languages. - Timothy Ng 001; David Rappaport; Kai Salomaa (J. Autom. Lang. Comb., 2017)

State complexity of operations on input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (J. Comput. Syst. Sci., 2017)

State complexity of permutation on finite languages over a binary alphabet. - Da-Jung Cho; Daniel Goc; Yo-Sub Han; Sang-Ki Ko; Alexandros Palioudakis; Kai Salomaa (Theor. Comput. Sci., 2017)

Pseudoknot-generating operation. - Da-Jung Cho; Yo-Sub Han; Timothy Ng 001; Kai Salomaa (Theor. Comput. Sci., 2017)

Outfix-guided insertion. - Da-Jung Cho; Yo-Sub Han; Timothy Ng 001; Kai Salomaa (Theor. Comput. Sci., 2017)

State complexity of prefix distance. - Timothy Ng 001; David Rappaport; Kai Salomaa (Theor. Comput. Sci., 2017)

Site-Directed Insertion: Decision Problems, Maximality and Minimality. - Da-Jung Cho; Yo-Sub Han; Kai Salomaa; Taylor J. Smith (DCFS, 2018)

Cycle Height of Finite Automata. - Chris Keeler; Kai Salomaa (DCFS, 2018)

Site-Directed Deletion. - Da-Jung Cho; Yo-Sub Han; Hwee Kim; Kai Salomaa (DLT, 2018)

Routing in a polygonal terrain with the shortest beacon watchtower. - Bahram Kouhestani; David Rappaport; Kai Salomaa (Comput. Geom., 2018)

State Complexity of Neighbourhoods and Approximate Pattern Matching. - Timothy Ng 001; David Rappaport; Kai Salomaa (Int. J. Found. Comput. Sci., 2018)

Growth Rate of Minimum Branching. - Alexandros Palioudakis; Yo-Sub Han; Kai Salomaa (J. Autom. Lang. Comb., 2018)

Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (DCFS, 2019)

Nondeterminism Growth and State Complexity. - Chris Keeler; Kai Salomaa (DCFS, 2019)

The Relative Edit-Distance Between Two Input-Driven Languages. - Hyunjoon Cheon; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (DLT, 2019)

Decision Problems for Restricted Variants of Two-Dimensional Automata. - Taylor J. Smith; Kai Salomaa (CIAA, 2019)

Branching Measures and Nearly Acyclic NFAs. - Chris Keeler; Kai Salomaa (Int. J. Found. Comput. Sci., 2019)

State Complexity of Suffix Distance. - Timothy Ng 001; David Rappaport; Kai Salomaa (Int. J. Found. Comput. Sci., 2019)

State Complexity of the Quotient Operation on Input-Driven Pushdown Automata. - Alexander Okhotin; Kai Salomaa (Int. J. Found. Comput. Sci., 2019)

Localized algorithms for redundant readers elimination in RFID networks. - Nafiul Rashid; Salimur Choudhury; Kai Salomaa (Int. J. Parallel Emergent Distributed Syst., 2019)

Site-directed insertion: Language equations and decision problems. - Da-Jung Cho; Yo-Sub Han; Kai Salomaa; Taylor J. Smith (Theor. Comput. Sci., 2019)

Edit distance neighbourhoods of input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (Theor. Comput. Sci., 2019)

Further closure properties of input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (Theor. Comput. Sci., 2019)

Improved Recruitment Algorithms for Vehicular Crowdsensing Networks. - Fabio Campioni; Salimur Choudhury; Kai Salomaa; Selim G. Akl (IEEE Trans. Veh. Technol., 2019)

Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata. - Chris Keeler; Kai Salomaa (DCFS, 2020)

Alternating Finite Automata with Limited Universal Branching. - Chris Keeler; Kai Salomaa (LATA, 2020)

Width Measures of Alternating Finite Automata. - Chris Keeler; Kai Salomaa (DCFS, 2021)

Concatenation Operations and Restricted Variants of Two-Dimensional Automata. - Taylor J. Smith; Kai Salomaa (SOFSEM, 2021)

Degrees of Restriction for Two-Dimensional Automata. - Taylor J. Smith; Kai Salomaa (CIAA, 2021)

Consensus string problem for multiple regular languages. - Yo-Sub Han; Sang-Ki Ko; Timothy Ng 001; Kai Salomaa (Inf. Comput., 2021)

Generalizations of Code Languages with Marginal Errors. - Sang-Ki Ko; Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2021)

Closest substring problems for regular languages. - Yo-Sub Han; Sang-Ki Ko; Timothy Ng 001; Kai Salomaa (Theor. Comput. Sci., 2021)

Decision problems and projection languages for restricted variants of two-dimensional automata. - Taylor J. Smith; Kai Salomaa (Theor. Comput. Sci., 2021)

Resource Optimization of SFC Embedding for IoT Networks Using Quantum Computing. - Mahzabeen Emu; Salimur Choudhury; Kai Salomaa (CAMAD, 2022)

A Two-Stage Based Strategy to Optimize Homeless Placement in Shelters. - Peash Ranjan Saha; Salimur Choudhury; Kai Salomaa (IHTC, 2022)

Nondeterministic State Complexity of Site-Directed Deletion. - Oliver A. S. Lyon; Kai Salomaa (CIAA, 2022)

Structural properties of NFAs and growth rates of nondeterminism measures. - Chris Keeler; Kai Salomaa (Inf. Comput., 2022)

Nondeterministic State Complexity of Site-Directed Insertion. - Oliver A. S. Lyon; Kai Salomaa (J. Autom. Lang. Comb., 2022)

An online fair resource allocation solution for fog computing. - Jia He Sun; Salimur Choudhury; Kai Salomaa (Int. J. Parallel Emergent Distributed Syst., 2022)

Existential and Universal Width of Alternating Finite Automata. - Yo-Sub Han; Sungmin Kim; Sang-Ki Ko; Kai Salomaa (DCFS, 2023)

On the Simon's Congruence Neighborhood of Languages. - Sungmin Kim; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (DLT, 2023)

Quantum Computing Empowered Metaverse: An Approach for Resource Optimization. - Mahzabeen Emu; Salimur Choudhury; Kai Salomaa (ICC, 2023)

Multi-Objective Task Assignment Solution for Parked Vehicular Computing. - Jia He Sun; Salimur Choudhury; Kai Salomaa (ICORES, 2023)

Quantum Neural Networks driven Stochastic Resource Optimization for Metaverse Data Marketplace. - Mahzabeen Emu; Salimur Choudhury; Kai Salomaa (NetSoft, 2023)

Balancing Matching of Two-Sided Agents with Adaptive and Fair Instability. - Peash Ranjan Saha; Salimur Choudhury; Kai Salomaa (SSCI, 2023)

Maximal Existential and Universal Width. - Casey Keeler; Kai Salomaa (Sci. Ann. Comput. Sci., 2023)

Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. - Taylor J. Smith; Kai Salomaa (J. Autom. Lang. Comb., 2023)

Deciding path size of nondeterministic (and input-driven) pushdown automata. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Theor. Comput. Sci., 2023)

The nondeterministic state complexity of the site-directed deletion language operation. - Oliver A. S. Lyon; Kai Salomaa (Theor. Comput. Sci., 2023)

On Simon's congruence closure of a string. - Sungmin Kim; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Theor. Comput. Sci., 2023)

Universal Rewriting Rules for the Parikh Matrix Injectivity Problem. - Ingyu Baek; Joonghyuk Hahn; Yo-Sub Han; Kai Salomaa (DLT, 2024)

Robust Virtual Network Function Optimization Under Post-Failure Uncertainty: Classical & Quantum Computing. - Mahzabeen Emu; Salimur Choudhury; Kai Salomaa (DRCN, 2024)

Altruistic Bandit Learning For One-to-Many Matching Markets. - Peash Ranjan Saha; Salimur Choudhury; Kai Salomaa (GoodIT, 2024)

Next-Generation Vehicle Platooning: Leveraging Quantum Long Short-Term Memory Networks. - Mahzabeen Emu; Taufiq Rahman; Salimur Choudhury; Kai Salomaa (QCE, 2024)

Descriptional Complexity of Finite Automata - Selected Highlights. - Arto Salomaa; Kai Salomaa; Taylor J. Smith (Fundam. Informaticae, 2024)

Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. - Zoltán Fülöp 001; George Rahonis; Kai Salomaa (Int. J. Found. Comput. Sci., 2024)

Warm and Cold Start Quantum Annealing for Metaverse Resource Optimization. - Mahzabeen Emu; Salimur Choudhury; Kai Salomaa (IEEE Open J. Commun. Soc., 2024)

Converting finite width AFAs to nondeterministic and universal finite automata. - Mohammad Zakzok; Kai Salomaa (Theor. Comput. Sci., 2024)

Stochastic Resource Optimization for Metaverse Data Marketplace by Leveraging Quantum Neural Networks. - Mahzabeen Emu; Salimur Choudhury; Kai Salomaa (IEEE Trans. Netw. Serv. Manag., 2024)

Small Balanced Vertex Separators in NFA to Regular Expression Conversion. - Derek Youngman; Kai Salomaa (DCFS, 2025)

Algorithmic Approach of Majority Voting With Agents' Inclusiveness for Facility Resource Matching. - Peash Ranjan Saha; Salimur Choudhury; Kai Salomaa (IEEE Access, 2025)

Quantum Long Short-Term Memory-Assisted Optimization for Efficient Vehicle Platooning in Connected and Autonomous Systems. - Mahzabeen Emu; Taufiq Rahman; Salimur Choudhury; Kai Salomaa (IEEE Open J. Comput. Soc., 2025)

Maximal universal width of an AFA is NP-hard. - John Alajaji; Kai Salomaa (Theor. Comput. Sci., 2025)