• HOME
• ABOUT US
  • Organization
  • Personnel
• NEWS&EVENTS
  • News & Events archive
  • Newsletter archive
  • Conference archive
  • Travel reports
• COOPERATION
  • International Involvement
  • National Involvement
  • Regional Involvement
• EDUCATION
  • Master's Programmes
  • TUCS Graduate Programmes
  • Information for Students
  • Courses
  • TUCS Short Courses
• PUBLICATIONS
  • TUCS Publication Series
  • How to Publish in TUCS Series
  • Publication Search
  • Publication Graph
  • Publication Input
  • Publication Input Guide
  • JuFo Browser
• RESEARCH
  • Focus areas
  • Research Programmes
  • Research Units
  • Distinguished Lectures

Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search

• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Department: Any ÅAU / Department of Information Technologies UTU / Department of Information Technology UTU / Department of Mathematics and Statistics UTU / Turku School of Economics, Institute of Information Systems Sciences

Research Unit: Any Algorithmics and Computational Intelligence Group (ACI) Biomathematics Research Unit (BIOMATH) Communication Systems (ComSys) Computational Biomodeling Laboratory (Combio Lab) Data Mining and Knowledge Management Laboratory Distributed Systems Laboratory (DS Lab) Embedded Computer and Electronic Systems (ECES) Embedded Systems Laboratory (ESLAB) FUNDIM, Fundamentals of Computing and Discrete Mathematics Institute for Advanced Management Systems Research (IAMSR) Learning and Reasoning Lab Software Construction Laboratorium Software Development Laboratory (SwDev) Software Engineering Laboratory (SE Lab) Turku BioNLP Group Turku Optimization Group (TOpGroup) UTU Information Systems Science (ISS)

Publication type: Any Monographs Edited books Edited special issues of journals Edited proceedings Articles in journals Articles in proceedings Chapters in edited books Ph.D. thesis Lic. thesis Technical reports

Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points

Sort output by publication type Sort output by publication year

and display below and download in BibTeX and download as CSV and download as 2014-CSV

Articles in journals (8):

• Mikhail Barash, Alexander Okhotin, An Extension of Context-Free Grammars with One-Sided Context Specifications. Information and Computation 237, 268–293, 2014.
• Tommi Lehtinen, Alexander Okhotin, On Equations Over Sets of Numbers and Their Limitations. International Journal of Foundations of Computer Science 22(2), 377–393, 2011.
• Oscar Ibarra, Juhani Karhumäki, Alexander Okhotin, On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. Theoretical Computer Science 411(3), 581–593 , 2010.
• Juhani Karhumäki, Michal Kunc, Alexander Okhotin, Computational Power of Two Stacks with Restricted Communication. Information and Computation 208(9), 1060–1089 , 2010.
• Tommi Lehtinen, Alexander Okhotin, Boolean Grammars and gsm Mappings. International Journal of Foundations of Computer Science , 2010.
• Juhani Karhumäki, Michal Kunc, Alexander Okhotin, Computing by Commuting. Theoretical Computer Science 356(1-2), 200–211, 2006.
• Alexander Okhotin, Computational Universality in One-variable Language Equations. Fundamenta Informaticae 74(4), 563–578, 2006.
• Alexander Okhotin, Generalized LR Parsing Algorithm for Boolean Grammars. International Journal of Foundations of Computer Science 17(3), 629–664, 2006.

Articles in proceedings (7):

• Mikhail Barash, Alexander Okhotin, Grammars with Two-Sided Contexts. In: Zoltan Esik, Zoltan Fulop (Eds.), Proceedings 14th International Conference on Automata and Formal Languages, 94–108, EPTCS, 2014.
• Mikhail Barash, Alexander Okhotin, Linear Grammars with One-Sided Contexts and Their Automaton Representation. In: Alberto Pardo, Alfredo Viola (Eds.), LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, Lecture Notes in Computer Science 8392, 190–201, Springer, 2014.
• Mikhail Barash, Alexander Okhotin, Defining Contexts in Context-Free Grammars. In: Adrian-Horia Dediu, Carlos Martin-Vide (Eds.), Language and Automata Theory and Applications, LNCS 7183, 106–118, Springer, 2012.
• Tommi Lehtinen, Alexander Okhotin, On Language Equations XXK=XXL and XM=N Over a Unary Alphabet. In: 2010.
• Tommi Lehtinen, Alexander Okhotin, On Equations over Sets of Numbers and their Limitations. In: Developments in Language Theory 2009, LNCS, 360-371, Springer, 2009.
• Oscar Ibarra, Juhani Karhumäki, Alexander Okhotin, On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. In: Eduardo Laber, Claudson Bornstein, Loana Nogueira, Luerbio Faria (Eds.), LATIN 2008: Theoretical Informatics, 94-105, Springer, 2008.
• Tommi Lehtinen, Alexander Okhotin, Boolean grammars and gsm mappings. In: Automat and Formal Languages. The 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27-30, 2008, Proceedings., 2008.

TUCS General Series (1):

• Michal Kunc, Alexander Okhotin (Eds.), Theory and Applications of Language Equations, Proceedings of the 1st International Workshop, Turku, Finland, 2 July 2007 , TUCS General Publication, Turku Centre for Computer Science, 2007.

Technical reports (37):

• Alexander Okhotin, Seven families of language equations. TUCS Technical Reports 844, Turku Centre for Computer Science, 2015.
• Mikhail Barash, Alexander Okhotin, Linear Grammars with One-Sided Contexts and Their Automaton Representation. TUCS Technical Reports 1088, TUCS, 2013.
• Mikhail Barash, Alexander Okhotin, Grammars With Two-Sided Contexts. TUCS Technical Reports 1090, Turku Centre for Computer Science, 2013.
• Alexander Okhotin, Inverse Homomorphic Characterizations of Conjunctive and Boolean Grammars. TUCS Technical Reports 1080, TUCS, 2013.
• Artur Jez, Alexander Okhotin, Unambiguous Conjunctive Grammars Over a One-Letter Alphabet. TUCS Technical Reports 1043, Turku Centre for Computer Science, 2012.
• Michal Kunc, Alexander Okhotin, Making Graph-Walking Automata Reversible. TUCS Technical Reports 1042, Turku Centre for Computer Science, 2012.
• Alexander Okhotin, Mikhail Barash, Defining Contexts in Context-Free Grammars. TUCS Technical Reports 1025, Turku Centre for Computer Science, 2012.
• Michal Kunc, Alexander Okhotin, On Deterministic Two-Way Finite Automata Over a Unary Alphabet. TUCS Technical Reports 950, Turku Centre for Computer Science, 2011.
• Alexander Okhotin, Michal Kunc, Reversible Two-Way Finite Automata Over a Unary Alphabet. TUCS Technical Reports 1024, Turku Centre for Computer Science, 2011.
• Artur Jez, Alexander Okhotin, On Equations Over Sets of Integers. TUCS Technical Reports 954, Turku Centre for Computer Science, 2010.
• Alexander Okhotin, Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm. TUCS Technical Reports 953, Turku Centre for Computer Science, 2010.
• Tommi Lehtinen, Alexander Okhotin, On Equations X+X+C=X+X+D and X+E=F with Unknown X Subseteq N. TUCS Technical Reports 952, Turku Centre for Computer Science, 2009.
• Alexander Okhotin, A Study of Unambiguous Finite Automata Over a One-Letter Alphabet. TUCS Technical Reports 951, Turku Centre for Computer Science, 2009.
• Alexander Okhotin, Christian Reitwiessner, Conjunctive grammars with restricted disjunction. TUCS Technical Reports 915, Turku Centre for Computer Science, 2009.
• Michael Domaratzki, Alexander Okhotin, State Complexity of Power. TUCS Technical Reports 845, Turku Centre for Computer Science, 2008.
• Artur Jez, Alexander Okhotin, On the Computational Completeness of Equations Over Sets of Natural Numbers. TUCS Technical Reports 910, Turku Centre for Computer Science, 2008.
• Artur Jez, Alexander Okhotin, Univariate Equations Over Sets of Natural Numbers. TUCS Technical Reports 913, Turku Centre for Computer Science, 2008.
• Artur Jez, Alexander Okhotin, Equations Over Sets of Natural Numbers with Addition Only. TUCS Technical Reports 914, Turku Centre for Computer Science, 2008.
• Galina Jiraskova, Alexander Okhotin, On the State Complexity of Operations on Two-Way Finite automata. TUCS Technical Reports 912, Turku Centre for Computer Science, 2008.
• Juhani Karhumäki, Michal Kunc, Alexander Okhotin, Computational Power of Two Stacks with Restricted Communication. TUCS Technical Reports 744, Turku Centre for Computer Science, 2008.
• Tommi Lehtinen, Alexander Okhotin, Boolean Grammars Are Closed Under Inverse Gsm Mappings. TUCS Technical Reports 911, Turku Centre for Computer Science, 2008.
• Alexander Okhotin, An 11-state Trellis Automaton for A P-complete Problem. TUCS Technical Reports 850, Turku Centre for Computer Science, 2008.
• Oscar H. Ibarra, Juhani Karhumaki, Alexander Okhotin, On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. TUCS Technical Reports 848, Turku Centre for Computer Science, 2007.
• Artur Jez, Alexander Okhotin, Language Equations with Addition in Positional Notation. TUCS Technical Reports 824, Turku Centre for Computer Science, 2007.
• Artur Jez, Alexander Okhotin, Complexity of Solutions of Equations Over Sets of Numbers. TUCS Technical Reports 847, Turku Centre for Computer Science, 2007.
• Galina Jiraskova, Alexander Okhotin, On the State Complexity of Star of Union and Star of Intersection. TUCS Technical Reports 825, Turku Centre for Computer Science, 2007.
• Tommi Lehtinen, Alexander Okhotin, Boolean grammars are closed under inverse homomorphisms. TUCS Technical Reports 846, Turku Centre for Computer Science, 2007.
• Alexander Okhotin, Unambiguous Boolean Grammars. TUCS Technical Reports 802, Turku Centre for Computer Science, 2007.
• Alexander Okhotin, Expressive Power of LL(k) Boolean Grammars. TUCS Technical Reports 823, Turku Centre for Computer Science, 2007.
• Alexander Okhotin, Notes on dual concatenation. TUCS Technical Reports 843, Turku Centre for Computer Science, 2007.
• Alexander Okhotin, On the State Complexity of Scattered Substrings and Superstrings. TUCS Technical Reports 849, Turku Centre for Computer Science, 2007.
• Franz Baader, Alexander Okhotin, On Language Equations with One-Sided Concatenation. TUCS Technical Reports 743, Turku Centre for Computer Science, 2006.
• Alexander Okhotin, Nine Open Problems on Conjunctive and Boolean Grammars. TUCS Technical Reports 794, Turku Centre for Computer Science, 2006.
• Juhani Karhumäki, Michal Kunc, Alexander Okhotin, Computing by Commuting. TUCS Technical Reports 733, Turku Centre for Computer Science, 2005.