Full Text Documents

Chargement de la page

Search

Chargement de la page
Table of Contents
Descriptional Complexity of Formal Systems
Yo-Sub Han, Sang-Ki Ko
 
Complexity Issues for the Iterated h-Preorders
Pavel Alaev, Victor Selivanov
1-12
On the Uniform Distribution of Regular Expressions
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
13-25
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets
Viliam Geffert, Alexander Okhotin
26-37
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups
Stefan Hoffmann
38-50
Commutative Regular Languages with Product-Form Minimal Automata
Stefan Hoffmann
51-63
State Complexity Investigations on Commutative Languages – the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages
Stefan Hoffmann
64-75
More on the Descriptional Complexity of Products of Finite Automata
Markus Holzer, Christian Rauch
76-87
Width Measures of Alternating Finite Automata
Chris Keeler, Kai Salomaa
88-99
Partial Derivative Automaton by Compressing Regular Expressions
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
100-112
State Complexity of Partial Word Finite Automata
Martin Kutrib, Matthias Wendlandt
113-124
State Complexity of Union and Intersection on Graph-Walking Automata
Olga Martynova, Alexander Okhotin
125-136
Gray Cycles of Maximum Length Related to k-Character Substitutions
Jean Néraud
137-149
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems
Alexander Rubtsov, Mikhail Vyalyi
150-162
Disambiguation of Weighted Tree Automata
Kevin Stier, Markus Ulbricht
163-175
Image-Binary Automata
Stefan Kiefer, Cas Widdershoven
176-187
Improved Constructions for Succinct Affine Automata
Abuzer Yakaryilmaz
188-199

 


Designed by Inria-IES Team : http://hal.inria.fr/    Hosted by HAL : http://hal.archives-ouvertes.fr/