dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Kai Salomaa (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Sang-Ki Ko, Kai Salomaa: Computing the Edit-Distance between a Regular Language and a Context-Free Language. Developments in Language Theory 2012: 85-96
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa: Overlap-Free Languages and solid Codes. Int. J. Found. Comput. Sci. 22(5): 1197-1209 (2011)
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa: Nondeterministic State Complexity for Suffix-Free Regular Languages DCFS 2010: 189-196
122no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa, Derick Wood: Operational State Complexity of Prefix-Free Regular Languages. Automata, Formal Languages, and Related Topics 2009: 99-115
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa, Sheng Yu: State Complexity of Combined Operations for Prefix-Free Regular Languages. LATA 2009: 398-409
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa, Derick Wood: Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Fundam. Inform. 90(1-2): 93-106 (2009)
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa: State complexity of basic operations on suffix-free regular languages. Theor. Comput. Sci. 410(27-29): 2537-2548 (2009)
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa: Nondeterministic state complexity of nested word automata. Theor. Comput. Sci. 410(30-32): 2961-2971 (2009)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa: State Complexity of Union and Intersection of Finite Languages. Int. J. Found. Comput. Sci. 19(3): 581-595 (2008)
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa: State Complexity of Union and Intersection of Finite Languages. Developments in Language Theory 2007: 217-228
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa: State Complexity of Basic Operations on Suffix-Free Regular Languages. MFCS 2007: 501-512
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa, Derick Wood: Intercode Regular Languages. Fundam. Inform. 76(1-2): 113-128 (2007)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-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)
82no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa, Derick Wood: State Complexity of Prefix-Free Regular Languages. DCFS 2006: 165-176
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYo-Sub Han, Kai Salomaa, Derick Wood: Prime Decompositions of Regular Languages. Developments in Language Theory 2006: 145-155

Selection of 15 from 152 records - Kai Salomaa has 42 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page