Skip to main content Skip to main navigation menu Skip to site footer
Acta Cybernetica
  • Accepted Papers
  • Current
  • Archives
  • Announcements
  • About
    • About the Journal
    • Submissions
    • Editorial Team
    • Contact
Search
  • Register
  • Login
  1. Home /
  2. Archives /
  3. Vol 10 No 3 (1992) /
  4. Regular articles

Alternation bounds for tree automata

  • Kai Salomaa

Downloads

Download data is not yet available.
  • PDF
Published
1992-01-01
How to Cite
Salomaa, K. (1992). Alternation bounds for tree automata. Acta Cybernetica, 10(3), 173-197. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3405
  • ACM
  • APA
  • Chicago
  • IEEE
  • Turabian
Download Citation
  • Endnote/Zotero/Mendeley (RIS)
  • BibTeX
Issue
Vol 10 No 3 (1992)
Section
Regular articles

Most read articles by the same author(s)

  • Kai Salomaa, Sheng Yu, Generalized fairness and context-free languages , Acta Cybernetica: Vol 14 No 1 (1999)
  • Yo-Sub Han, Arto Salomaa, Kai Salomaa, Ambiguity, nondeterminism and state complexity of finite automata , Acta Cybernetica: Vol 23 No 1 (2017)
Open Journal Systems
Information
  • For Readers
  • For Authors
  • For Librarians
Make a Submission
Most read in last month
  • Detecting Uninitialized Variables in C++ with the Clang Static Analyzer
    53
  • A Constraint Programming Approach for Polytopic Simulation of Ordinary Differential Equations
    40
  • Preface + In memoriam of Nicolas Delanoue
    35
  • The Codac Library
    33
  • RISC-V Based Hardware Acceleration of Interval Contractor Primitives in the Context of Mobile Robotics
    32
Current Issue
  • Atom logo
  • RSS2 logo
  • RSS1 logo
Publisher    
University of Szeged, Institute of Informatics
Publisher's headquarters    
Árpád square 2, H-6720 Szeged, Hungary
Responsible Publisher    
László Nyúl
Editor-in-chief    
Tibor Csendes
Managing editor    
Boglárka G.-Tóth
ISSN    
0324-721X (Print)
ISSN    
2676-993X (Online)
 
 
About this Publishing System