default search action
Informatique Théorique et Applications, Volume 32
Volume 32, Numbers 1-3, 1998
- S. Nguyen, Daniele Pretolani, Lilian Markenzon:
On Some Path Problems on Oriented Hypergraphs. 1-20 - L. Dubuc:
Sur Les Automates Circulaires et la Conjecture de Cerný. 21-34 - L. Bernátsky, Zoltán Ésik:
Semantics on Flowchart Programs and the Free Conway Theories. 35-78 - Alberto Bertoni, Paolo Massazza:
On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages. 79-98
Volume 32, Numbers 4-6, 1998
- Flavio Corradini, Roberto Gorrieri, Davide Marchignoli:
Towards parallelization of concurrent systems. 99-125 - Martin Beaudry:
Finite idempotent groupoids and regular languages. 127-140 - Alessandro Avellone, Massimiliano Goldwurm:
Analysis of algorithms for the recognition of rational and context-free trace languages. 141-152 - Alexandru Mateescu, George Daniel Mateescu:
Associative closure and periodicity of $\omega $-words. 153-174 - Stephen L. Bloom, Zoltán Ésik:
Shuffle binoids. 175-198
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.