


default search action
Journal of Automata, Languages and Combinatorics, Volume 18
Volume 18, Number 1, 2013
- S. Harbich:

On the Descriptional Complexity of k-Uniformly-Limited Lindenmayer Systems. 3-25 - Jean-Gabriel Luque, Ludovic Mignot, Florent Nicart:

Some Combinatorial Operators in Language Theory. 27-52 - Henk Barendregt, Venanzio Capretta, Dexter Kozen:

Reflection in the Chomsky Hierarchy. 53-60
Volume 18, Number 2, January 2013
- Charles Dominic:

δ-Neighborhood Chromatic Index of a Graph. 65-70 - Peter M. Higgins, Suhear Alwan:

Languages that Require Full Scanning of Words to Determine Membership. 71-95 - Sergey Kitaev:

On Graphs with Representation Number 3. 97-112 - Sándor Vágvölgyi:

Recognizing Relations by Tree Automata. 113-125

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














