Kai Salomaa

According to our database1, Kai Salomaa
  • authored at least 223 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
State complexity of prefix distance.
Theor. Comput. Sci., 2017

State complexity of permutation on finite languages over a binary alphabet.
Theor. Comput. Sci., 2017

State complexity of operations on input-driven pushdown automata.
J. Comput. Syst. Sci., 2017

Worst Case Branching and Other Measures of Nondeterminism.
Int. J. Found. Comput. Sci., 2017

Ambiguity, Nondeterminism and State Complexity of Finite Automata.
Acta Cybern., 2017

Consensus String Problem for Multiple Regular Languages.
Proceedings of the Language and Automata Theory and Applications, 2017

The Quotient Operation on Input-Driven Pushdown Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

Branching Measures and Nearly Acyclic NFAs.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

State Complexity of Suffix Distance.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

Edit Distance Neighbourhoods of Input-Driven Pushdown Automata.
Proceedings of the Computer Science - Theory and Applications, 2017

Quasi-Distances and Weighted Finite Automata.
Proceedings of the Role of Theory in Computer Science, 2017

2016
Operational state complexity of unary NFAs with finite nondeterminism.
Theor. Comput. Sci., 2016

State complexity of inversion operations.
Theor. Comput. Sci., 2016

Pseudo-inversion: closure properties and decidability.
Natural Computing, 2016

Duplications and Pseudo-Duplications.
IJUC, 2016

State Complexity of Insertion.
Int. J. Found. Comput. Sci., 2016

Approximate matching between a context-free grammar and a finite-state automaton.
Inf. Comput., 2016

State complexity of deletion and bipolar deletion.
Acta Inf., 2016

Pseudoknot-Generating Operation.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

CARRE: Cellular automaton based redundant readers elimination in RFID networks.
Proceedings of the 2016 IEEE International Conference on Communications, 2016

Outfix-Guided Insertion - (Extended Abstract).
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

State Complexity of Prefix Distance of Subregular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

The Length of the Beacon Attraction Trajectory.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Descriptional complexity of unambiguous input-driven pushdown automata.
Theor. Comput. Sci., 2015

Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form.
IJUC, 2015

Cellular Automaton Based Localized Algorithms for Mobile Sensor Networks.
IJUC, 2015

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages.
Int. J. Found. Comput. Sci., 2015

State Complexity of Kleene-Star Operations on Regular Tree Languages.
Acta Cybern., 2015

State Complexity of Prefix Distance.
Proceedings of the Implementation and Application of Automata, 2015

Cellular automata and object monitoring in mobile wireless sensor networks.
Proceedings of the 2015 IEEE Wireless Communications and Networking Conference, 2015

Duplications and Pseudo-Duplications.
Proceedings of the Unconventional Computation and Natural Computation, 2015

State Complexity of Neighbourhoods and Approximate Pattern Matching.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Generalizations of Code Languages with Marginal Errors.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

The State Complexity of Permutations on Finite Languages over Binary Alphabets.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

Quasi-Distances and Weighted Finite Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

Nondeterministic Tree Width of Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

On the Inverse Beacon Attraction Region of a Point.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Complexity of input-driven pushdown automata.
SIGACT News, 2014

Cellular automaton-based algorithms for the dispersion of mobile wireless sensor networks.
IJPEDS, 2014

Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA.
Journal of Automata, Languages and Combinatorics, 2014

Nondeterministic State Complexity of Proportional Removals.
Int. J. Found. Comput. Sci., 2014

Pseudo-inversion on Formal Languages.
Proceedings of the Unconventional Computation and Natural Computation, 2014

Unary NFAs with Limited Nondeterminism.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Top-Down Tree Edit-Distance of Regular Tree Languages.
Proceedings of the Language and Automata Theory and Applications, 2014

Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper).
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

State Complexity of Deletion.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

Computation Width and Deviation Number.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

State Complexity of Inversion Operations.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

Cellular automata and Mobile Wireless Sensor Networks.
Proceedings of the IEEE 27th Canadian Conference on Electrical and Computer Engineering, 2014

Routing in a Polygonal Terrain with the Shortest Beacon Watchtower.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

State Complexity of Combined Operations for Prefix-Free Regular Languages.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012.
Int. J. Found. Comput. Sci., 2013

The Edit-Distance between a Regular Language and a Context-Free Language.
Int. J. Found. Comput. Sci., 2013

Undecidability of state complexity.
Int. J. Comput. Math., 2013

Approximate Matching between a Context-Free Grammar and a Finite-State Automaton.
Proceedings of the Implementation and Application of Automata, 2013

Input-driven pushdown automata: nondeterminism and unambiguity.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

Finite Nondeterminism vs. DFAs with Multiple Initial States.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

Comparisons between Measures of Nondeterminism on Finite Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

Nondeterministic State Complexity of Proportional Removals.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
Lower bounds for the size of deterministic unranked tree automata.
Theor. Comput. Sci., 2012

State complexity of the concatenation of regular tree languages.
Theor. Comput. Sci., 2012

Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes.
Natural Computing, 2012

A Cellular Automaton Model for Wireless Sensor Networks.
J. Cellular Automata, 2012

State Complexity of Finite Tree Width NFAs.
Journal of Automata, Languages and Combinatorics, 2012

State-Size Hierarchy for Finite-State Complexity.
Int. J. Found. Comput. Sci., 2012

Sheng Yu (1950-2012) In Memoriam.
Fundam. Inform., 2012

In Memoriam Sheng Yu.
Proceedings of the Implementation and Application of Automata, 2012

Energy efficient cellular automaton based algorithms for mobile wireless sensor networks.
Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks.
Proceedings of the Theory and Practice of Natural Computing, 2012

Cellular automaton based algorithms for depth adjustment in underwater mobile sensor networks.
Proceedings of the 9th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, 2012

A cellular automaton model for connectivity preserving deployment of mobile wireless sensors.
Proceedings of IEEE International Conference on Communications, 2012

Computing the Edit-Distance between a Regular Language and a Context-Free Language.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

State Complexity of Projection and Quotient on Unranked Trees.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

State Complexity and Limited Nondeterminism.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

State Complexity of Kleene-Star Operations on Trees.
Proceedings of the Computation, Physics and Beyond, 2012

Descriptional Complexity of Input-Driven Pushdown Automata.
Proceedings of the Languages Alive, 2012

2011
Finite state complexity.
Theor. Comput. Sci., 2011

Editorial: Computing with biomolecules.
Natural Computing, 2011

Overlap-Free Languages and solid Codes.
Int. J. Found. Comput. Sci., 2011

Preface.
Int. J. Found. Comput. Sci., 2011

Limitations of lower bound methods for deterministic nested word automata.
Inf. Comput., 2011

Transformations Between Different Models of Unranked Bottom-Up Tree Automata.
Fundam. Inform., 2011

Transition Complexity of Incomplete DFAs.
Fundam. Inform., 2011

Extended Watson-Crick L Systems with Regular Trigger Languages.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

State Complexity of Operations on Input-Driven Pushdown Automata.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Undecidability of the State Complexity of Composed Regular Operations.
Proceedings of the Language and Automata Theory and Applications, 2011

Descriptional Complexity of Unambiguous Nested Word Automata.
Proceedings of the Language and Automata Theory and Applications, 2011

State Trade-Offs in Unranked Tree Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

On Language Decompositions and Primality.
Proceedings of the Rainbow of Computer Science, 2011

Tree Homomorphisms for Unranked Trees.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
Analysis of a cellular automaton model for car traffic with a slow-to-stop rule.
Theor. Comput. Sci., 2010

Orthogonal Concatenation: Language Equations and State Complexity.
J. UCS, 2010

An Improved Cellular Automata Based Algorithm for the 45-Convex Hull Problem.
J. Cellular Automata, 2010

Finite-State Complexity and the Size of Transducers
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Nondeterministic State Complexity for Suffix-Free Regular Languages
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Transformations Between Different Types of Unranked Bottom-Up Tree Automata
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Operational State Complexity of Deterministic Unranked Tree Automata
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Transition Complexity of Incomplete DFAs
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

2009
Deciding determinism of caterpillar expressions.
Theor. Comput. Sci., 2009

Operational state complexity of nested word automata.
Theor. Comput. Sci., 2009

Nondeterministic state complexity of nested word automata.
Theor. Comput. Sci., 2009

State complexity of basic operations on suffix-free regular languages.
Theor. Comput. Sci., 2009

On the descriptional complexity of Watson-Crick automata.
Theor. Comput. Sci., 2009

On the synchronized derivation depth of context-free grammars.
Theor. Comput. Sci., 2009

Variants of codes and indecomposable languages.
Inf. Comput., 2009

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages.
Fundam. Inform., 2009

State complexity of orthogonal catenation
CoRR, 2009

A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule.
Proceedings of the Implementation and Application of Automata, 2009

State Complexity of Nested Word Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

State Complexity of Combined Operations for Prefix-Free Regular Languages.
Proceedings of the Language and Automata Theory and Applications, 2009

A Cryptosystem Based on the Composition of Reversible Cellular Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

Operational State Complexity of Prefix-Free Regular Languages.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008
Lower bounds for the transition complexity of NFAs.
J. Comput. Syst. Sci., 2008

State Complexity of Union and Intersection of Finite Languages.
Int. J. Found. Comput. Sci., 2008

Preface.
Int. J. Found. Comput. Sci., 2008

The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal.
Fundam. Inform., 2008

Language Decompositions, Primality, and Trajectory-Based Operations.
Proceedings of the Implementation and Applications of Automata, 2008

Length Codes, Products of Languages and Primality.
Proceedings of the Language and Automata Theory and Applications, 2008

Operational State Complexity of Nested Word Automata.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

State Complexity of Orthogonal Catenation.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

Watson-Crick automata: determinism and state complexity.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

On the Synchronized Derivation Depth of Context-Free Grammars.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
State complexity of combined operations.
Theor. Comput. Sci., 2007

On the existence of prime decompositions.
Theor. Comput. Sci., 2007

Transition complexity of language operations.
Theor. Comput. Sci., 2007

On the existence of regular approximations.
Theor. Comput. Sci., 2007

An infinite hierarchy induced by depth synchronization.
Theor. Comput. Sci., 2007

On the State Complexity of Combined Operations and their Estimation.
Int. J. Found. Comput. Sci., 2007

State Complexity of Additive Weighted Finite Automata.
Int. J. Found. Comput. Sci., 2007

Intercode Regular Languages.
Fundam. Inform., 2007

Deterministic Caterpillar Expressions.
Proceedings of the Implementation and Application of Automata, 2007

State Complexity of Basic Operations on Suffix-Free Regular Languages.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Descriptional Complexity of Nondeterministic Finite Automata.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

State Complexity of Union and Intersection of Finite Languages.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Codes defined by multiple sets of trajectories.
Theor. Comput. Sci., 2006

Interpreted Trajectories.
Fundam. Inform., 2006

Lower Bounds for the Transition Complexity of NFAs.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Prime Decompositions of Regular Languages.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

State Complexity of Prefix-Free Regular Languages.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

State Complexity of Catenation and Reversal Combined with Star.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

Transition Complexity of Language Operations.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

Regular Approximations of Non-Regular Languages.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

An Infinite Hierarchy Induced by Depth Synchronization.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

Iterated TGR Languages: Membership Problem and Effective Closure Properties.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Decidability of trajectory-based equations.
Theor. Comput. Sci., 2005

Preface.
Int. J. Found. Comput. Sci., 2005

Restricted sets of trajectories and decidability of shuffle decompositions.
Int. J. Found. Comput. Sci., 2005

Contextual Grammars with Uniform Sets of Trajectories.
Fundam. Inform., 2005

2004
State Complexity of Shuffle on Trajectories.
Journal of Automata, Languages and Combinatorics, 2004

Decidability of Trajectory-Based Equations.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Restricted sets of trajectories and decidability of shuffle decompositions.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof.
Proceedings of the Theory Is Forever, 2004

2003
A Formal Study Of Practical Regular Expressions.
Int. J. Found. Comput. Sci., 2003

2002
Decidability of EDT0L structural equivalence.
Theor. Comput. Sci., 2002

Additive Distances and Quasi-Distances Between Words.
J. UCS, 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.
J. UCS, 2002

Tight Lower Bound for the State Complexity of Shuffle of Regular Languages.
Journal of Automata, Languages and Combinatorics, 2002

Shuffle Decompositions of Regular Languages.
Int. J. Found. Comput. Sci., 2002

One-Visit Caterpillar Tree Automata.
Fundam. Inform., 2002

Regex and Extended Regex.
Proceedings of the Implementation and Application of Automata, 2002

State Complexity of Shuffle on Trajectories.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001
On the State Complexity of k-Entry Deterministic Finite Automata.
Journal of Automata, Languages and Combinatorics, 2001

A sharpening of the Parikh mapping.
ITA, 2001

Shuffle Quotient and Decompositions.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000
Alternating finite automata and star-free languages.
Theor. Comput. Sci., 2000

Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata.
Theor. Comput. Sci., 2000

On Fairness of Many-Dimensional Trajectories.
Journal of Automata, Languages and Combinatorics, 2000

1999
Synchronization Expressions and Languages.
J. UCS, 1999

Generalized Fairness and Context-Free Languages.
Acta Cybern., 1999

State Complexity of Basic Operations on Finite Languages.
Proceedings of the Automata Implementation, 1999

Metric Lexical Analysis.
Proceedings of the Automata Implementation, 1999

Synchronization Expressions: Characterization Results and Implementation.
Proceedings of the Jewels are Forever, 1999

1998
Synchronization Expressions with Extended Join Operation.
Theor. Comput. Sci., 1998

On the Size of Stack and Synchronization Alphabets of Tree Automata.
Fundam. Inform., 1998

Implementing Reversed Alternating Finite Automaton (r-AFA) Operations.
Proceedings of the Automata Implementation, 1998

1997
NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets.
Journal of Automata, Languages and Combinatorics, 1997

Semantics of Nonsequential Tree-Based Computation Schemes.
Fundam. Inform., 1997

Efficient Implementation of Regular Languages Using R-AFA.
Proceedings of the Automata Implementation, 1997

Hierarchies of synchronized and algebraic forests.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Decidability of fairness for context-free languages.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Rewriting Rules for Synchronization Languages.
Proceedings of the Structures in Logic and Computer Science, 1997

Block-Synchronization Context-Free Grammars.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996
Structural Equivalence and ET0L Grammars.
Theor. Comput. Sci., 1996

Decidability of Equivalence for Deterministic Synchronized Tree Automata.
Theor. Comput. Sci., 1996

On the Modularity of Decidability of Completeness and Termination.
Journal of Automata, Languages and Combinatorics, 1996

Yield-Languages of Two-Way Pushdown Tree Automata.
Inf. Process. Lett., 1996

On Synchronization Languages.
Fundam. Inform., 1996

NFA to DFA Transformation for Finite Languages.
Proceedings of the Automata Implementation, 1996

EDTOL Structural Equivalence is Decidable.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995
P, NP and the Post Correspondence Problem
Inf. Comput., September, 1995

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.
J. UCS, 1995

Decision Problems for Patterns.
J. Comput. Syst. Sci., 1995

Complexity of E0L Structural Equivalence.
ITA, 1995

Decidability of Equivalence for Deterministic Synchronized Tree Automata.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Nondeterminism Degrees for Context-Free Languages.
Proceedings of the Developments in Language Theory II, 1995

1994
The State Complexities of Some Basic Operations on Regular Languages.
Theor. Comput. Sci., 1994

Synchronized Tree Automata.
Theor. Comput. Sci., 1994

Transducers and the Decidability of Independence in Free Monoids.
Theor. Comput. Sci., 1994

Semantics of Trees.
Mathematical Systems Theory, 1994

Measures of Nondeterminism for Pushdown Automata.
J. Comput. Syst. Sci., 1994

Pumping and Pushdown Machines.
ITA, 1994

Synchronization expressions and languages.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Complexity of E0L Structural Equivalence.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Rediscovering Pushdown Machines.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
Decidability of the Intercode Property.
Elektronische Informationsverarbeitung und Kybernetik, 1993

Morphisms and rational tranducers.
Bulletin of the EATCS, 1993

Inclusion is Undecidable for Pattern Languages.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Structural Equivalences and ET0L Grammars (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992
Confluence, ground confluence, and termination of monadic term rewriting systems.
Elektronische Informationsverarbeitung und Kybernetik, 1992

Alternation Bounds for Tree Automata.
Acta Cybern., 1992

Obtaining Tight Upper Bounds for the State Complexities of DFA Operations.
Proceedings of the Computing and Information, 1992

1991
Decidability of Structural Equivalence of E0L Grammars.
Theor. Comput. Sci., 1991

Primary Types of Instances of the Post Correspondence Problem.
Bulletin of the EATCS, 1991

Decidability of Confluence and Termination of Monadic Term Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

Degrees of Nondeterminism for Pushdown Automata.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
The Immortality Problem for LAG Systems.
Inf. Process. Lett., 1990

1989
Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems.
J. Comput. Syst. Sci., 1988

Yield-Languages Recognized by Alternating Tree Recognizers.
ITA, 1988

1986
Alternating Bottom-Up Tree Recognisers.
Proceedings of the CAAP '86, 1986

1984
Direction Independent Context-Sensitive Grammars
Information and Control, 1984


  Loading...