default search action
Kai Salomaa
Person information
- affiliation: Queen's University, Kingston, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j145]Arto Salomaa, Kai Salomaa, Taylor J. Smith
:
Descriptional Complexity of Finite Automata - Selected Highlights. Fundam. Informaticae 191(3-4): 231-237 (2024) - [j144]Zoltán Fülöp, George Rahonis, Kai Salomaa:
Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. Int. J. Found. Comput. Sci. 35(1&2): 1 (2024) - [j143]Mahzabeen Emu
Warm and Cold Start Quantum Annealing for Metaverse Resource Optimization. IEEE Open J. Commun. Soc. 5: 1057-1071 (2024) - [j142]Mohammad Zakzok, Kai Salomaa:
Converting finite width AFAs to nondeterministic and universal finite automata. Theor. Comput. Sci. 996: 114506 (2024) - [j141]Mahzabeen Emu
Stochastic Resource Optimization for Metaverse Data Marketplace by Leveraging Quantum Neural Networks. IEEE Trans. Netw. Serv. Manag. 21(3): 2613-2623 (2024) - [c140]Ingyu Baek, Joonghyuk Hahn, Yo-Sub Han, Kai Salomaa:
Universal Rewriting Rules for the Parikh Matrix Injectivity Problem. DLT 2024: 68-81 - [c139]Mahzabeen Emu, Salimur Choudhury, Kai Salomaa:
Robust Virtual Network Function Optimization Under Post-Failure Uncertainty: Classical & Quantum Computing. DRCN 2024: 129-135 - [c138]Peash Ranjan Saha
Altruistic Bandit Learning For One-to-Many Matching Markets. GoodIT 2024: 197-203 - 2023
- [j140]Casey Keeler, Kai Salomaa:
Maximal Existential and Universal Width. Sci. Ann. Comput. Sci. 33(1): 53-77 (2023) - [j139]Taylor J. Smith
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. J. Autom. Lang. Comb. 28(1-3): 201-220 (2023) - [j138]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Deciding path size of nondeterministic (and input-driven) pushdown automata. Theor. Comput. Sci. 939: 170-181 (2023) - [j137]Oliver A. S. Lyon
The nondeterministic state complexity of the site-directed deletion language operation. Theor. Comput. Sci. 968: 113999 (2023) - [j136]Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
On Simon's congruence closure of a string. Theor. Comput. Sci. 972: 114078 (2023) - [c137]Yo-Sub Han, Sungmin Kim, Sang-Ki Ko, Kai Salomaa:
Existential and Universal Width of Alternating Finite Automata. DCFS 2023: 51-64 - [c136]Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
On the Simon's Congruence Neighborhood of Languages. DLT 2023: 168-181 - [c135]Mahzabeen Emu, Salimur Choudhury, Kai Salomaa:
Quantum Computing Empowered Metaverse: An Approach for Resource Optimization. ICC 2023: 2412-2418 - [c134]Jia He Sun, Salimur Choudhury, Kai Salomaa:
Multi-Objective Task Assignment Solution for Parked Vehicular Computing. ICORES 2023: 193-202 - [c133]Mahzabeen Emu, Salimur Choudhury, Kai Salomaa:
Quantum Neural Networks driven Stochastic Resource Optimization for Metaverse Data Marketplace. NetSoft 2023: 242-246 - [c132]Peash Ranjan Saha, Salimur Choudhury, Kai Salomaa:
Balancing Matching of Two-Sided Agents with Adaptive and Fair Instability. SSCI 2023: 1682-1689 - [i8]Arto Salomaa, Kai Salomaa, Taylor J. Smith:
Descriptional Complexity of Finite Automata - Selected Highlights. CoRR abs/2301.03708 (2023) - 2022
- [j135]Chris Keeler, Kai Salomaa:
Structural properties of NFAs and growth rates of nondeterminism measures. Inf. Comput. 284: 104690 (2022) - [j134]Oliver A. S. Lyon, Kai Salomaa:
Nondeterministic State Complexity of Site-Directed Insertion. J. Autom. Lang. Comb. 27(1-3): 187-197 (2022) - [j133]Jia He Sun
An online fair resource allocation solution for fog computing. Int. J. Parallel Emergent Distributed Syst. 37(4): 456-477 (2022) - [c131]Mahzabeen Emu, Salimur Choudhury, Kai Salomaa:
Resource Optimization of SFC Embedding for IoT Networks Using Quantum Computing. CAMAD 2022: 83-88 - [c130]Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
On Simon's Congruence Closure of a String. DCFS 2022: 127-141 - [c129]Peash Ranjan Saha, Salimur Choudhury, Kai Salomaa:
A Two-Stage Based Strategy to Optimize Homeless Placement in Shelters. IHTC 2022: 49-55 - [c128]Oliver A. S. Lyon, Kai Salomaa:
Nondeterministic State Complexity of Site-Directed Deletion. CIAA 2022: 189-199 - 2021
- [j132]Yo-Sub Han, Sang-Ki Ko
Consensus string problem for multiple regular languages. Inf. Comput. 279: 104615 (2021) - [j131]Sang-Ki Ko
Generalizations of Code Languages with Marginal Errors. Int. J. Found. Comput. Sci. 32(5): 509-529 (2021) - [j130]Yo-Sub Han, Sang-Ki Ko
Closest substring problems for regular languages. Theor. Comput. Sci. 862: 144-154 (2021) - [j129]Taylor J. Smith
Decision problems and projection languages for restricted variants of two-dimensional automata. Theor. Comput. Sci. 870: 153-164 (2021) - [c127]Chris Keeler, Kai Salomaa:
Width Measures of Alternating Finite Automata. DCFS 2021: 88-99 - [c126]Taylor J. Smith
Concatenation Operations and Restricted Variants of Two-Dimensional Automata. SOFSEM 2021: 147-158 - [c125]Taylor J. Smith
Degrees of Restriction for Two-Dimensional Automata. CIAA 2021: 77-89 - [i7]Taylor J. Smith, Kai Salomaa:
Degrees of Restriction for Two-Dimensional Automata. CoRR abs/2105.01179 (2021) - 2020
- [c124]Chris Keeler, Kai Salomaa:
Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata. DCFS 2020: 91-103 - [c123]Taylor J. Smith
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. DCFS 2020: 206-218 - [c122]Chris Keeler, Kai Salomaa:
Alternating Finite Automata with Limited Universal Branching. LATA 2020: 196-207 - [i6]Taylor J. Smith, Kai Salomaa:
Concatenation Operations and Restricted Variants of Two-Dimensional Automata. CoRR abs/2008.11164 (2020) - [i5]Taylor J. Smith, Kai Salomaa:
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. CoRR abs/2009.00602 (2020)
2010 – 2019
- 2019
- [j128]Chris Keeler, Kai Salomaa:
Branching Measures and Nearly Acyclic NFAs. Int. J. Found. Comput. Sci. 30(6-7): 1135-1155 (2019) - [j127]Timothy Ng
State Complexity of Suffix Distance. Int. J. Found. Comput. Sci. 30(6-7): 1197-1216 (2019) - [j126]Alexander Okhotin, Kai Salomaa:
State Complexity of the Quotient Operation on Input-Driven Pushdown Automata. Int. J. Found. Comput. Sci. 30(6-7): 1217-1235 (2019) - [j125]Nafiul Rashid, Salimur Choudhury, Kai Salomaa:
Localized algorithms for redundant readers elimination in RFID networks. Int. J. Parallel Emergent Distributed Syst. 34(3): 260-271 (2019) - [j124]Alexander Okhotin
Edit distance neighbourhoods of input-driven pushdown automata. Theor. Comput. Sci. 777: 417-430 (2019) - [j123]Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith
Site-directed insertion: Language equations and decision problems. Theor. Comput. Sci. 798: 40-51 (2019) - [j122]Alexander Okhotin
Further closure properties of input-driven pushdown automata. Theor. Comput. Sci. 798: 65-77 (2019) - [j121]Fabio Campioni, Salimur Choudhury
Improved Recruitment Algorithms for Vehicular Crowdsensing Networks. IEEE Trans. Veh. Technol. 68(2): 1198-1207 (2019) - [c121]Yo-Sub Han, Sang-Ki Ko
Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. DCFS 2019: 158-170 - [c120]Chris Keeler, Kai Salomaa:
Nondeterminism Growth and State Complexity. DCFS 2019: 210-222 - [c119]Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko
The Relative Edit-Distance Between Two Input-Driven Languages. DLT 2019: 127-139 - [c118]Taylor J. Smith
Decision Problems for Restricted Variants of Two-Dimensional Automata. CIAA 2019: 222-234 - [i4]Taylor J. Smith, Kai Salomaa:
Decision Problems for Restricted Variants of Two-Dimensional Automata. CoRR abs/1904.11100 (2019) - 2018
- [j120]Bahram Kouhestani, David Rappaport, Kai Salomaa:
Routing in a polygonal terrain with the shortest beacon watchtower. Comput. Geom. 68: 34-47 (2018) - [j119]Timothy Ng
State Complexity of Neighbourhoods and Approximate Pattern Matching. Int. J. Found. Comput. Sci. 29(2): 315-329 (2018) - [j118]Alexandros Palioudakis, Yo-Sub Han, Kai Salomaa:
Growth Rate of Minimum Branching. J. Autom. Lang. Comb. 23(1-3): 281-292 (2018) - [c117]Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith
Site-Directed Insertion: Decision Problems, Maximality and Minimality. DCFS 2018: 49-61 - [c116]Chris Keeler, Kai Salomaa:
Cycle Height of Finite Automata. DCFS 2018: 200-211 - [c115]Alexander Okhotin
Further Closure Properties of Input-Driven Pushdown Automata. DCFS 2018: 224-236 - [c114]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa:
Site-Directed Deletion. DLT 2018: 219-230 - [c113]Yo-Sub Han, Sang-Ki Ko
Closest Substring Problems for Regular Languages. DLT 2018: 392-403 - [i3]Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-Directed Insertion: Decision Problems, Maximality and Minimality. CoRR abs/1804.11017 (2018) - 2017
- [j117]Yo-Sub Han, Arto Salomaa, Kai Salomaa:
Ambiguity, Nondeterminism and State Complexity of Finite Automata. Acta Cybern. 23(1): 141-157 (2017) - [j116]Kai Salomaa, Andrew L. Szilard:
Report on the Magic in Science symposium. Bull. EATCS 123 (2017) - [j115]Yo-Sub Han, Sang-Ki Ko
State Complexity of k-Parallel Tree Concatenation. Fundam. Informaticae 154(1-4): 185-199 (2017) - [j114]Alexandros Palioudakis
Worst Case Branching and Other Measures of Nondeterminism. Int. J. Found. Comput. Sci. 28(3): 195-210 (2017) - [j113]Yo-Sub Han, Kai Salomaa:
Preface. Int. J. Found. Comput. Sci. 28(5): 437-440 (2017) - [j112]Timothy Ng
State Complexity of Prefix Distance of Subregular Languages. J. Autom. Lang. Comb. 22(1-3): 169-188 (2017) - [j111]Alexander Okhotin
State complexity of operations on input-driven pushdown automata. J. Comput. Syst. Sci. 86: 207-228 (2017) - [j110]Timothy Ng
State complexity of prefix distance. Theor. Comput. Sci. 679: 107-117 (2017) - [j109]Da-Jung Cho, Daniel Goc
State complexity of permutation on finite languages over a binary alphabet. Theor. Comput. Sci. 682: 67-78 (2017) - [j108]Da-Jung Cho, Yo-Sub Han, Timothy Ng
Pseudoknot-generating operation. Theor. Comput. Sci. 696: 52-64 (2017) - [j107]Da-Jung Cho, Yo-Sub Han, Timothy Ng
Outfix-guided insertion. Theor. Comput. Sci. 701: 70-84 (2017) - [c112]Timothy Ng
Quasi-Distances and Weighted Finite Automata. The Role of Theory in Computer Science 2017: 135-152 - [c111]Alexander Okhotin
Edit Distance Neighbourhoods of Input-Driven Pushdown Automata. CSR 2017: 260-272 - [c110]Chris Keeler, Kai Salomaa:
Branching Measures and Nearly Acyclic NFAs. DCFS 2017: 202-213 - [c109]Timothy Ng
State Complexity of Suffix Distance. DCFS 2017: 287-298 - [c108]Alexander Okhotin
The Quotient Operation on Input-Driven Pushdown Automata. DCFS 2017: 299-310 - [c107]Timothy Ng
Relative Prefix Distance Between Languages. DLT 2017: 284-295 - [c106]Yo-Sub Han, Sang-Ki Ko
Consensus String Problem for Multiple Regular Languages. LATA 2017: 196-207 - [i2]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-guided insertion. CoRR abs/1707.04651 (2017) - 2016
- [j106]Yo-Sub Han, Sang-Ki Ko
State complexity of deletion and bipolar deletion. Acta Informatica 53(1): 67-85 (2016) - [j105]Sang-Ki Ko
Approximate matching between a context-free grammar and a finite-state automaton. Inf. Comput. 247: 278-289 (2016) - [j104]Yo-Sub Han, Sang-Ki Ko
State Complexity of Insertion. Int. J. Found. Comput. Sci. 27(7): 863-878 (2016) - [j103]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. Int. J. Unconv. Comput. 12(2-3): 145-167 (2016) - [j102]Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko
Pseudo-inversion: closure properties and decidability. Nat. Comput. 15(1): 31-39 (2016) - [j101]Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko
State complexity of inversion operations. Theor. Comput. Sci. 610: 2-12 (2016) - [j100]Alexandros Palioudakis
Operational state complexity of unary NFAs with finite nondeterminism. Theor. Comput. Sci. 610: 108-120 (2016) - [c105]Bahram Kouhestani, David Rappaport, Kai Salomaa:
The Length of the Beacon Attraction Trajectory. CCCG 2016: 69-74 - [c104]Timothy Ng
State Complexity of Prefix Distance of Subregular Languages. DCFS 2016: 192-204 - [c103]Da-Jung Cho, Yo-Sub Han, Timothy Ng
Outfix-Guided Insertion - (Extended Abstract). DLT 2016: 102-113 - [c102]Nafiul Rashid, Salimur Choudhury, Kai Salomaa:
CARRE: Cellular automaton based redundant readers elimination in RFID networks. ICC 2016: 1-6 - [c101]Da-Jung Cho, Yo-Sub Han, Timothy Ng
Pseudoknot-Generating Operation. SOFSEM 2016: 241-252 - [e3]Yo-Sub Han, Kai Salomaa:
Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings. Lecture Notes in Computer Science 9705, Springer 2016, ISBN 978-3-319-40945-0 [contents] - 2015
- [j99]Yo-Sub Han, Sang-Ki Ko
State Complexity of Kleene-Star Operations on Regular Tree Languages. Acta Cybern. 22(2): 403-422 (2015) - [j98]Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. Int. J. Found. Comput. Sci. 26(2): 211-228 (2015) - [j97]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form. Int. J. Unconv. Comput. 11(5-6): 395-416 (2015) - [j96]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular Automaton Based Localized Algorithms for Mobile Sensor Networks. Int. J. Unconv. Comput. 11(5-6): 417-447 (2015) - [j95]Alexander Okhotin
Descriptional complexity of unambiguous input-driven pushdown automata. Theor. Comput. Sci. 566: 1-11 (2015) - [c100]Bahram Kouhestani, David Rappaport, Kai Salomaa:
On the Inverse Beacon Attraction Region of a Point. CCCG 2015 - [c99]Cezar Câmpeanu
Nondeterministic Tree Width of Regular Languages. DCFS 2015: 46-57 - [c98]Timothy Ng
Quasi-Distances and Weighted Finite Automata. DCFS 2015: 209-219 - [c97]Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko
The State Complexity of Permutations on Finite Languages over Binary Alphabets. DCFS 2015: 220-230 - [c96]Yo-Sub Han, Sang-Ki Ko
Generalizations of Code Languages with Marginal Errors. DLT 2015: 264-275 - [c95]Timothy Ng
State Complexity of Neighbourhoods and Approximate Pattern Matching. DLT 2015: 389-400 - [c94]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. UCNC 2015: 157-168 - [c93]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular automata and object monitoring in mobile wireless sensor networks. WCNC 2015: 1344-1349 - [c92]Timothy Ng
State Complexity of Prefix Distance. CIAA 2015: 238-249 - 2014
- [j94]Daniel Goc, Alexandros Palioudakis, Kai Salomaa:
Nondeterministic State Complexity of Proportional Removals. Int. J. Found. Comput. Sci. 25(7): 823-836 (2014) - [j93]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA. J. Autom. Lang. Comb. 19(1-4): 251-264 (2014) - [j92]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular automaton-based algorithms for the dispersion of mobile wireless sensor networks. Int. J. Parallel Emergent Distributed Syst. 29(2): 147-177 (2014) - [j91]Alexander Okhotin, Kai Salomaa:
Complexity of input-driven pushdown automata. SIGACT News 45(2): 47-67 (2014) - [c91]Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu:
State Complexity of Combined Operations for Prefix-Free Regular Languages. Discrete Mathematics and Computer Science 2014: 137-151 - [c90]Bahram Kouhestani, David Rappaport, Kai Salomaa:
Routing in a Polygonal Terrain with the Shortest Beacon Watchtower. CCCG 2014 - [c89]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular automata and Mobile Wireless Sensor Networks. CCECE 2014: 1-5 - [c88]Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko
State Complexity of Inversion Operations. DCFS 2014: 102-113 - [c87]Daniel Goc, Kai Salomaa:
Computation Width and Deviation Number. DCFS 2014: 150-161 - [c86]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism. DCFS 2014: 330-341 - [c85]Yo-Sub Han, Sang-Ki Ko
State Complexity of Deletion. Developments in Language Theory 2014: 37-48 - [c84]Alexander Okhotin
Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper). Developments in Language Theory 2014: 84-102 - [c83]Sang-Ki Ko
Top-Down Tree Edit-Distance of Regular Tree Languages. LATA 2014: 466-477 - [c82]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Unary NFAs with Limited Nondeterminism. SOFSEM 2014: 443-454 - [c81]Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko
Pseudo-inversion on Formal Languages. UCNC 2014: 93-104 - 2013
- [j90]Arto Salomaa, Kai Salomaa, Sheng Yu:
Undecidability of state complexity. Int. J. Comput. Math. 90(6): 1310-1320 (2013) - [j89]Arto Salomaa, Kai Salomaa, Andrew L. Szilard:
Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012. Int. J. Found. Comput. Sci. 24(7): 945-954 (2013) - [j88]Yo-Sub Han, Sang-Ki Ko
The Edit-Distance between a Regular Language and a Context-Free Language. Int. J. Found. Comput. Sci. 24(7): 1067-1082 (2013) - [c80]Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. DCFS 2013: 78-89 - [c79]Daniel Goc, Alexandros Palioudakis, Kai Salomaa:
Nondeterministic State Complexity of Proportional Removals. DCFS 2013: 102-111 - [c78]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Comparisons between Measures of Nondeterminism on Finite Automata. DCFS 2013: 217-228 - [c77]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Finite Nondeterminism vs. DFAs with Multiple Initial States. DCFS 2013: 229-240 - [c76]Alexander Okhotin, Kai Salomaa:
Input-driven pushdown automata: nondeterminism and unambiguity. NCMA 2013: 31-33 - [c75]Yo-Sub Han, Sang-Ki Ko
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton. CIAA 2013: 146-157 - 2012
- [j87]Arto Salomaa, Kai Salomaa, Andrew L. Szilard:
Sheng Yu (1950-2012) In Memoriam. Fundam. Informaticae 120(1): 71-74 (2012) - [j86]Cristian S. Calude
State-Size Hierarchy for Finite-State Complexity. Int. J. Found. Comput. Sci. 23(1): 37-50 (2012) - [j85]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity of Finite Tree Width NFAs. J. Autom. Lang. Comb. 17(2-4): 245-264 (2012) - [j84]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
A Cellular Automaton Model for Wireless Sensor Networks. J. Cell. Autom. 7(3): 223-241 (2012) - [j83]David Sears, Kai Salomaa:
Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes. Nat. Comput. 11(4): 653-664 (2012) - [j82]Xiaoxue Piao, Kai Salomaa:
State complexity of the concatenation of regular tree languages. Theor. Comput. Sci. 429: 273-281 (2012) - [j81]Xiaoxue Piao, Kai Salomaa:
Lower bounds for the size of deterministic unranked tree automata. Theor. Comput. Sci. 454: 231-239 (2012) - [c74]Alexander Okhotin, Xiaoxue Piao, Kai Salomaa:
Descriptional Complexity of Input-Driven Pushdown Automata. Languages Alive 2012: 186-206 - [c73]Xiaoxue Piao, Kai Salomaa:
State Complexity of Kleene-Star Operations on Trees. Computation, Physics and Beyond 2012: 388-402 - [c72]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity and Limited Nondeterminism. DCFS 2012: 252-265 - [c71]Xiaoxue Piao, Kai Salomaa:
State Complexity of Projection and Quotient on Unranked Trees. DCFS 2012: 280-293 - [c70]Yo-Sub Han, Sang-Ki Ko
Computing the Edit-Distance between a Regular Language and a Context-Free Language. Developments in Language Theory 2012: 85-96 - [c69]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
A cellular automaton model for connectivity preserving deployment of mobile wireless sensors. ICC 2012: 6545-6549 - [c68]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular automaton based algorithms for depth adjustment in underwater mobile sensor networks. MASS Workshops 2012: 1-6 - [c67]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks. TPNC 2012: 108-120 - [c66]Salimur Choudhury, Selim G. Akl, Kai Salomaa:
Energy efficient cellular automaton based algorithms for mobile wireless sensor networks. WCNC 2012: 2341-2346 - [c65]Yuan Gao, Kai Salomaa:
In Memoriam Sheng Yu. CIAA 2012: 1-4 - 2011
- [j80]Xiaoxue Piao, Kai Salomaa:
Transformations Between Different Models of Unranked Bottom-Up Tree Automata. Fundam. Informaticae 109(4): 405-424 (2011) - [j79]Yuan Gao, Kai Salomaa, Sheng Yu:
Transition Complexity of Incomplete DFAs. Fundam. Informaticae 110(1-4): 143-158 (2011) - [j78]Kai Salomaa:
Limitations of lower bound methods for deterministic nested word automata. Inf. Comput. 209(3): 580-589 (2011) - [j77]Yo-Sub Han, Kai Salomaa:
Overlap-Free Languages and solid Codes. Int. J. Found. Comput. Sci. 22(5): 1197-1209 (2011) - [j76]Michael Domaratzki, Kai Salomaa:
Preface. Int. J. Found. Comput. Sci. 22(8) (2011) - [j75]Erzsébet Csuhaj-Varjú, Kai Salomaa:
Editorial: Computing with biomolecules. Nat. Comput. 10(2): 775-776 (2011) - [j74]Cristian S. Calude
Finite state complexity. Theor. Comput. Sci. 412(41): 5668-5677 (2011) - [c64]Xiaoxue Piao, Kai Salomaa, Sándor Vágvölgyi:
Tree Homomorphisms for Unranked Trees. AFL 2011: 343-357 - [c63]Michael Domaratzki, Kai Salomaa:
On Language Decompositions and Primality. Rainbow of Computer Science 2011: 63-75 - [c62]Xiaoxue Piao, Kai Salomaa:
State Trade-Offs in Unranked Tree Automata. DCFS 2011: 261-274 - [c61]Alexander Okhotin
Descriptional Complexity of Unambiguous Nested Word Automata. LATA 2011: 414-426 - [c60]Arto Salomaa, Kai Salomaa, Sheng Yu:
Undecidability of the State Complexity of Composed Regular Operations. LATA 2011: 489-498 - [c59]Alexander Okhotin
State Complexity of Operations on Input-Driven Pushdown Automata. MFCS 2011: 485-496 - [c58]David Sears, Kai Salomaa:
Extended Watson-Crick L Systems with Regular Trigger Languages. UC 2011: 212-223 - [e2]Michael Domaratzki, Kai Salomaa:
Implementation and Application of Automata - 15th International Conference, CIAA 2010, Winnipeg, MB, Canada, August 12-15, 2010. Revised Selected Papers. Lecture Notes in Computer Science 6482, Springer 2011, ISBN 978-3-642-18097-2 [contents] - 2010
- [j73]Adam Clarridge, Kai Salomaa:
An Improved Cellular Automata Based Algorithm for the 45-Convex Hull Problem. J. Cell. Autom. 5(1-2): 107-120 (2010) - [j72]Mark Daley, Michael Domaratzki, Kai Salomaa:
Orthogonal Concatenation: Language Equations and State Complexity. J. Univers. Comput. Sci. 16(5): 653-675 (2010) - [j71]Adam Clarridge, Kai Salomaa:
Analysis of a cellular automaton model for car traffic with a slow-to-stop rule. Theor. Comput. Sci. 411(38-39): 3507-3515 (2010) - [c57]Cristian Calude, Kai Salomaa, Tania Roblot:
Finite-State Complexity and the Size of Transducers. DCFS 2010: 38-47 - [c56]Yuan Gao, Kai Salomaa, Sheng Yu:
Transition Complexity of Incomplete DFAs. DCFS 2010: 99-109 - [c55]Xiaoxue Piao, Kai Salomaa:
Operational State Complexity of Deterministic Unranked Tree Automata. DCFS 2010: 149-158 - [c54]Xiaoxue Piao, Kai Salomaa:
Transformations Between Different Types of Unranked Bottom-Up Tree Automata. DCFS 2010: 159-168 - [c53]Yo-Sub Han, Kai Salomaa:
Nondeterministic State Complexity for Suffix-Free Regular Languages. DCFS 2010: 189-196
2000 – 2009
- 2009
- [j70]Yo-Sub Han, Kai Salomaa, Derick Wood:
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Fundam. Informaticae 90(1-2): 93-106 (2009) - [j69]Arto Salomaa, Kai Salomaa, Sheng Yu:
Variants of codes and indecomposable languages. Inf. Comput. 207(11): 1340-1349 (2009) - [j68]Yo-Sub Han, Kai Salomaa:
State complexity of basic operations on suffix-free regular languages. Theor. Comput. Sci. 410(27-29): 2537-2548 (2009) - [j67]Yo-Sub Han, Kai Salomaa:
Nondeterministic state complexity of nested word automata. Theor. Comput. Sci. 410(30-32): 2961-2971 (2009) - [j66]Franziska Biegler, Kai Salomaa:
On the synchronized derivation depth of context-free grammars. Theor. Comput. Sci. 410(35): 3198-3208 (2009) - [j65]Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa:
On the descriptional complexity of Watson-Crick automata. Theor. Comput. Sci. 410(35): 3250-3260 (2009) - [j64]Xiaoxue Piao, Kai Salomaa:
Operational state complexity of nested word automata. Theor. Comput. Sci. 410(35): 3290-3302 (2009) - [j63]Kai Salomaa, Sheng Yu, Jinfeng Zan:
Deciding determinism of caterpillar expressions. Theor. Comput. Sci. 410(37): 3438-3446 (2009) - [c52]Yo-Sub Han, Kai Salomaa, Derick Wood:
Operational State Complexity of Prefix-Free Regular Languages. Automata, Formal Languages, and Related Topics 2009: 99-115 - [c51]Kai Salomaa:
State Complexity of Nested Word Automata. LATA 2009: 59-70 - [c50]Adam Clarridge, Kai Salomaa:
A Cryptosystem Based on the Composition of Reversible Cellular Automata. LATA 2009: 314-325 - [c49]Yo-Sub Han, Kai Salomaa, Sheng Yu:
State Complexity of Combined Operations for Prefix-Free Regular Languages. LATA 2009: 398-409 - [c48]Adam Clarridge, Kai Salomaa:
A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule. CIAA 2009: 44-53 - [i1]Mark Daley, Michael Domaratzki, Kai Salomaa:
State complexity of orthogonal catenation. CoRR abs/0904.3366 (2009) - 2008
- [j62]Yuan Gao, Kai Salomaa, Sheng Yu:
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal. Fundam. Informaticae 83(1-2): 75-89 (2008) - [j61]Yo-Sub Han, Kai Salomaa:
State Complexity of Union and Intersection of Finite Languages. Int. J. Found. Comput. Sci. 19(3): 581-595 (2008) - [j60]Michael Domaratzki
Preface. Int. J. Found. Comput. Sci. 19(5): 1085-1086 (2008) - [j59]Michael Domaratzki
Lower bounds for the transition complexity of NFAs. J. Comput. Syst. Sci. 74(7): 1116-1130 (2008) - [c47]Franziska Biegler, Kai Salomaa:
On the Synchronized Derivation Depth of Context-Free Grammars. DCFS 2008: 73-84 - [c46]Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa:
Watson-Crick automata: determinism and state complexity. DCFS 2008: 121-133 - [c45]Mark Daley, Michael Domaratzki, Kai Salomaa:
State Complexity of Orthogonal Catenation. DCFS 2008: 134-144 - [c44]Xiaoxue Piao, Kai Salomaa:
Operational State Complexity of Nested Word Automata. DCFS 2008: 194-206 - [c43]Arto Salomaa, Kai Salomaa, Sheng Yu:
Length Codes, Products of Languages and Primality. LATA 2008: 476-486 - [c42]Kai Salomaa:
Language Decompositions, Primality, and Trajectory-Based Operations. CIAA 2008: 17-22 - 2007
- [j58]Yo-Sub Han, Kai Salomaa, Derick Wood:
Intercode Regular Languages. Fundam. Informaticae 76(1-2): 113-128 (2007) - [j57]Kai Salomaa, Sheng Yu:
On the State Complexity of Combined Operations and their Estimation. Int. J. Found. Comput. Sci. 18(4): 683-698 (2007) - [j56]Kai Salomaa, Paul N. Schofield:
State Complexity of Additive Weighted Finite Automata. Int. J. Found. Comput. Sci. 18(6): 1407-1416 (2007) - [j55]Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu:
On the existence of prime decompositions. Theor. Comput. Sci. 376(1-2): 60-69 (2007) - [j54]Arto Salomaa, Kai Salomaa, Sheng Yu:
State complexity of combined operations. Theor. Comput. Sci. 383(2-3): 140-152 (2007) - [j53]Franziska Biegler, Ian McQuillan, Kai Salomaa:
An infinite hierarchy induced by depth synchronization. Theor. Comput. Sci. 387(2): 113-124 (2007) - [j52]Brendan J. Cordy, Kai Salomaa:
On the existence of regular approximations. Theor. Comput. Sci. 387(2): 125-135 (2007) - [j51]Michael Domaratzki
Transition complexity of language operations. Theor. Comput. Sci. 387(2): 147-154 (2007) - [c41]Kai Salomaa:
Descriptional Complexity of Nondeterministic Finite Automata. Developments in Language Theory 2007: 31-35 - [c40]Yo-Sub Han, Kai Salomaa:
State Complexity of Union and Intersection of Finite Languages. Developments in Language Theory 2007: 217-228 - [c39]Yo-Sub Han, Kai Salomaa:
State Complexity of Basic Operations on Suffix-Free Regular Languages. MFCS 2007: 501-512 - [c38]Kai Salomaa, Sheng Yu, Jinfeng Zan:
Deterministic Caterpillar Expressions. CIAA 2007: 97-108 - 2006
- [j50]Michael Domaratzki, Grzegorz Rozenberg, Kai Salomaa:
Interpreted Trajectories. Fundam. Informaticae 73(1-2): 81-97 (2006) - [j49]Michael Domaratzki
Codes defined by multiple sets of trajectories. Theor. Comput. Sci. 366(3): 182-193 (2006) - [c37]Ian McQuillan, Kai Salomaa, Mark Daley:
Iterated TGR Languages: Membership Problem and Effective Closure Properties. COCOON 2006: 94-103 - [c36]Franziska Biegler, Ian McQuillan, Kai Salomaa:
An Infinite Hierarchy Induced by Depth Synchronization. DCFS 2006: 82-93 - [c35]Brendan J. Cordy, Kai Salomaa:
Regular Approximations of Non-Regular Languages. DCFS 2006: 118-129 - [c34]Michael Domaratzki, Kai Salomaa:
Transition Complexity of Language Operations. DCFS 2006: 141-152 - [c33]Yuan Gao, Kai Salomaa, Sheng Yu:
State Complexity of Catenation and Reversal Combined with Star. DCFS 2006: 153-164 - [c32]Yo-Sub Han, Kai Salomaa, Derick Wood:
State Complexity of Prefix-Free Regular Languages. DCFS 2006: 165-176 - [c31]Yo-Sub Han, Kai Salomaa, Derick Wood:
Prime Decompositions of Regular Languages. Developments in Language Theory 2006: 145-155 - [c30]Michael Domaratzki, Kai Salomaa:
Lower Bounds for the Transition Complexity of NFAs. MFCS 2006: 315-326 - 2005
- [j48]Alexander Okhotin, Kai Salomaa:
Contextual Grammars with Uniform Sets of Trajectories. Fundam. Informaticae 64(1-4): 341-351 (2005) - [j47]Kai Salomaa, Sheng Yu:
Preface. Int. J. Found. Comput. Sci. 16(3): 399-401 (2005) - [j46]Michael Domaratzki
Restricted sets of trajectories and decidability of shuffle decompositions. Int. J. Found. Comput. Sci. 16(5): 897-912 (2005) - [j45]Michael Domaratzki
Decidability of trajectory-based equations. Theor. Comput. Sci. 345(2-3): 304-330 (2005) - 2004
- [j44]Michael Domaratzki, Kai Salomaa:
State Complexity of Shuffle on Trajectories. J. Autom. Lang. Comb. 9(2/3): 217-232 (2004) - [c29]Kai Salomaa, Derick Wood:
Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. Theory Is Forever 2004: 259-267 - [c28]Michael Domaratzki, Kai Salomaa:
Restricted sets of trajectories and decidability of shuffle decompositions. DCFS 2004: 37-51 - [c27]Michael Domaratzki, Kai Salomaa:
Decidability of Trajectory-Based Equations. MFCS 2004: 723-734 - [e1]Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu:
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3317, Springer 2004, ISBN 3-540-24318-6 [contents] - 2003
- [j43]Cezar Câmpeanu
A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14(6): 1007-1018 (2003) - 2002
- [j42]Alexander Okhotin, Kai Salomaa, Michael Domaratzki:
One-Visit Caterpillar Tree Automata. Fundam. Informaticae 52(4): 361-375 (2002) - [j41]Cezar Câmpeanu
Shuffle Decompositions of Regular Languages. Int. J. Found. Comput. Sci. 13(6): 799-816 (2002) - [j40]Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. J. Autom. Lang. Comb. 7(3): 303-310 (2002) - [j39]Cristian Calude, Kai Salomaa, Sheng Yu:
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. J. Univers. Comput. Sci. 8(2): 117-118 (2002) - [j38]Cristian Calude, Kai Salomaa, Sheng Yu:
Additive Distances and Quasi-Distances Between Words. J. Univers. Comput. Sci. 8(2): 141-152 (2002) - [j37]Kai Salomaa, Sheng Yu:
Decidability of EDT0L structural equivalence. Theor. Comput. Sci. 276(1-2): 245-259 (2002) - [c26]Michael Domaratzki, Kai Salomaa:
State Complexity of Shuffle on Trajectories. DCFS 2002: 95-109 - [c25]Cezar Câmpeanu
Regex and Extended Regex. CIAA 2002: 77-84 - 2001
- [j36]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
A sharpening of the Parikh mapping. RAIRO Theor. Informatics Appl. 35(6): 551-564 (2001) - [j35]Markus Holzer, Kai Salomaa, Sheng Yu:
On the State Complexity of k-Entry Deterministic Finite Automata. J. Autom. Lang. Comb. 6(4): 453-466 (2001) - [c24]Cezar Câmpeanu
Shuffle Quotient and Decompositions. Developments in Language Theory 2001: 186-196 - 2000
- [j34]Alexandru Mateescu, Kai Salomaa, Sheng Yu:
On Fairness of Many-Dimensional Trajectories. J. Autom. Lang. Comb. 5(2): 145-157 (2000) - [j33]Kai Salomaa, Xiuming Wu, Sheng Yu:
Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. Theor. Comput. Sci. 231(1): 103-111 (2000) - [j32]Kai Salomaa, Sheng Yu:
Alternating finite automata and star-free languages. Theor. Comput. Sci. 234(1-2): 167-176 (2000) - [p1]Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
State Complexity of Regular Languages: Finite versus Infinite. Finite Versus Infinite 2000: 53-73
1990 – 1999
- 1999
- [j31]Kai Salomaa, Sheng Yu:
Generalized Fairness and Context-Free Languages. Acta Cybern. 14(1): 193-203 (1999) - [j30]Kai Salomaa, Sheng Yu:
Synchronization Expressions and Languages. J. Univers. Comput. Sci. 5(9): 610-621 (1999) - [c23]Kai Salomaa, Sheng Yu:
Synchronization Expressions: Characterization Results and Implementation. Jewels are Forever 1999: 45-56 - [c22]Cristian Calude, Kai Salomaa, Sheng Yu:
Metric Lexical Analysis. WIA 1999: 48-59 - [c21]Cezar Câmpeanu
State Complexity of Basic Operations on Finite Languages. WIA 1999: 60-70 - 1998
- [j29]George Rahonis
On the Size of Stack and Synchronization Alphabets of Tree Automata. Fundam. Informaticae 36(1): 57-69 (1998) - [j28]Kai Salomaa, Sheng Yu:
Synchronization Expressions with Extended Join Operation. Theor. Comput. Sci. 207(1): 73-88 (1998) - [c20]Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu:
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. Workshop on Implementing Automata 1998: 69-81 - 1997
- [j27]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa:
Semantics of Nonsequential Tree-Based Computation Schemes. Fundam. Informaticae 29(4): 305-324 (1997) - [j26]Kai Salomaa, Sheng Yu:
NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets. J. Autom. Lang. Comb. 2(3): 177-186 (1997) - [c19]Helmut Jürgensen, Kai Salomaa:
Block-Synchronization Context-Free Grammars. Advances in Algorithms, Languages, and Complexity 1997: 111-137 - [c18]Kai Salomaa, Sheng Yu:
Rewriting Rules for Synchronization Languages. Structures in Logic and Computer Science 1997: 322-338 - [c17]Alexandru Mateescu, Kai Salomaa, Sheng Yu:
Decidability of fairness for context-free languages. Developments in Language Theory 1997: 351-364 - [c16]George Rahonis, Kai Salomaa:
Hierarchies of synchronized and algebraic forests. Developments in Language Theory 1997: 447-460 - [c15]Kai Salomaa, Xiuming Wu, Sheng Yu:
Efficient Implementation of Regular Languages Using R-AFA. Workshop on Implementing Automata 1997: 176-184 - 1996
- [j25]Lifu Guo, Kai Salomaa, Sheng Yu:
On Synchronization Languages. Fundam. Informaticae 25(3): 423-436 (1996) - [j24]Kai Salomaa:
Yield-Languages of Two-Way Pushdown Tree Automata. Inf. Process. Lett. 58(4): 195-199 (1996) - [j23]Kai Salomaa:
On the Modularity of Decidability of Completeness and Termination. J. Autom. Lang. Comb. 1(1): 37-53 (1996) - [j22]Kai Salomaa, Derick Wood, Sheng Yu:
Structural Equivalence and ET0L Grammars. Theor. Comput. Sci. 164(1&2): 123-140 (1996) - [j21]Kai Salomaa:
Decidability of Equivalence for Deterministic Synchronized Tree Automata. Theor. Comput. Sci. 167(1&2): 171-192 (1996) - [c14]Kai Salomaa, Sheng Yu:
EDTOL Structural Equivalence is Decidable. DMTCS 1996: 363-375 - [c13]Kai Salomaa, Sheng Yu:
NFA to DFA Transformation for Finite Languages. Workshop on Implementing Automata 1996: 149-158 - 1995
- [j20]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
P, NP and the Post Correspondence Problem. Inf. Comput. 121(2): 135-142 (1995) - [j19]Kai Salomaa, Derick Wood, Sheng Yu:
Complexity of E0L Structural Equivalence. RAIRO Theor. Informatics Appl. 29(6): 471-485 (1995) - [j18]Tao Jiang
Decision Problems for Patterns. J. Comput. Syst. Sci. 50(1): 53-63 (1995) - [j17]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. J. Univers. Comput. Sci. 1(5): 292-311 (1995) - [c12]Kai Salomaa, Sheng Yu:
Nondeterminism Degrees for Context-Free Languages. Developments in Language Theory 1995: 154-165 - [c11]Kai Salomaa:
Decidability of Equivalence for Deterministic Synchronized Tree Automata. TAPSOFT 1995: 140-154 - 1994
- [j16]Kai Salomaa, Derick Wood, Sheng Yu:
Pumping and Pushdown Machines. RAIRO Theor. Informatics Appl. 28(3-4): 221-232 (1994) - [j15]Kai Salomaa, Sheng Yu:
Measures of Nondeterminism for Pushdown Automata. J. Comput. Syst. Sci. 49(2): 362-374 (1994) - [j14]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa:
Semantics of Trees. Math. Syst. Theory 27(2): 159-181 (1994) - [j13]Sheng Yu, Qingyu Zhuang, Kai Salomaa:
The State Complexities of Some Basic Operations on Regular Languages. Theor. Comput. Sci. 125(2): 315-328 (1994) - [j12]Kai Salomaa:
Synchronized Tree Automata. Theor. Comput. Sci. 127(1): 25-51 (1994) - [j11]Helmut Jürgensen, Kai Salomaa, Sheng Yu:
Transducers and the Decidability of Independence in Free Monoids. Theor. Comput. Sci. 134(1): 107-117 (1994) - [c10]Kai Salomaa, Derick Wood, Sheng Yu:
Rediscovering Pushdown Machines. Results and Trends in Theoretical Computer Science 1994: 372-385 - [c9]Kai Salomaa, Derick Wood, Sheng Yu:
Complexity of E0L Structural Equivalence. MFCS 1994: 587-596 - [c8]Lifu Guo, Kai Salomaa, Sheng Yu:
Synchronization expressions and languages. SPDP 1994: 257-264 - 1993
- [j10]Kai Salomaa, Sheng Yu:
Morphisms and rational tranducers. Bull. EATCS 50: 186-193 (1993) - [j9]Helmut Jürgensen, Kai Salomaa, Sheng Yu:
Decidability of the Intercode Property. J. Inf. Process. Cybern. 29(6): 375-380 (1993) - [c7]Kai Salomaa, Derick Wood, Sheng Yu:
Structural Equivalences and ET0L Grammars (Extended Abstract). FCT 1993: 430-439 - [c6]Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu:
Inclusion is Undecidable for Pattern Languages. ICALP 1993: 301-312 - 1992
- [j8]Kai Salomaa:
Alternation Bounds for Tree Automata. Acta Cybern. 10(3): 173-197 (1992) - [j7]Kai Salomaa:
Confluence, ground confluence, and termination of monadic term rewriting systems. J. Inf. Process. Cybern. 28(5): 279-309 (1992) - [c5]Sheng Yu, Qingyu Zhuang, Kai Salomaa:
Obtaining Tight Upper Bounds for the State Complexities of DFA Operations. ICCI 1992: 100-104 - 1991
- [j6]Arto Salomaa, Kai Salomaa, Sheng Yu:
Primary Types of Instances of the Post Correspondence Problem. Bull. EATCS 44: 226-241 (1991) - [j5]Kai Salomaa, Sheng Yu:
Decidability of Structural Equivalence of E0L Grammars. Theor. Comput. Sci. 82(1): 131-139 (1991) - [c4]Kai Salomaa, Sheng Yu:
Degrees of Nondeterminism for Pushdown Automata. FCT 1991: 380-389 - [c3]Kai Salomaa:
Decidability of Confluence and Termination of Monadic Term Rewriting Systems. RTA 1991: 275-286 - 1990
- [j4]Kai Salomaa, Sheng Yu:
The Immortality Problem for LAG Systems. Inf. Process. Lett. 36(6): 311-315 (1990)
1980 – 1989
- 1989
- [c2]Kai Salomaa:
Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers. FCT 1989: 372-383 - 1988
- [j3]Kai Salomaa:
Yield-Languages Recognized by Alternating Tree Recognizers. RAIRO Theor. Informatics Appl. 22(3): 319-339 (1988) - [j2]Kai Salomaa:
Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. J. Comput. Syst. Sci. 37(3): 367-394 (1988) - 1986
- [c1]Kai Salomaa:
Alternating Bottom-Up Tree Recognisers. CAAP 1986: 158-171 - 1984
- [j1]H. C. M. Kleijn, Martti Penttonen, Grzegorz Rozenberg, Kai Salomaa:
Direction Independent Context-Sensitive Grammars. Inf. Control. 63(1/2): 113-117 (1984)
Coauthor Index
[c140] [j138] [j136] [c137] [c136] [c130] [j132] [j131] [j130] [j123] [c121] [c119] [j118] [c117] [c114] [c113] [i3] [j117] [j115] [j113] [j109] [j108] [j107] [c106] [i2] [j106] [j105] [j104] [j103] [j102] [j101] [c103] [c101] [e3] [j99] [j98] [c97] [c96] [c94] [c91] [c88] [c85] [c83] [c81] [j88] [c80] [c75] [c70] [j77] [c53] [j70] [j68] [j67] [c52] [c49] [j61] [j58] [j55] [c40] [c39] [c32] [c31]
[c91] [j90] [j79] [c60] [c56] [j69] [j63] [c49] [j62] [c43] [j57] [j55] [j54] [c38] [c33] [j47] [e1] [j43] [j40] [j39] [j38] [j37] [c25] [j36] [j35] [j34] [j33] [j32] [p1] [j31] [j30] [c23] [c22] [c21] [j28] [c20] [j26] [c18] [c17] [c15] [j25] [j22] [c14] [c13] [j20] [j19] [j18] [j17] [c12] [j16] [j15] [j13] [j11] [c10] [c9] [c8] [j10] [j9] [c7] [c6] [c5] [j6] [j5] [c4] [j4]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: