Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarInformatique Théorique et Applications, Volume 15, 1981
Volume 15, Number 1, 1981
Patrice Enjalbert:
Systèmes de Déduction pour les Arbres et les Schémas de Programme (II). ITA 15(1): 3-21 (1981)- Marie Demlová, Jirí Demel, Václav Koubek:
On Subdirectly Irreducible Automata. ITA 15(1): 23-46 (1981)
Volume 15, Number 2, 1981
- Howard Straubing:
Relationals Morphisms and Operations on Recognizable Sets. ITA 15(2): 149-159 (1981) - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
FPOL Systems Generating Counting Languages. ITA 15(2): 161-173 (1981)
Volume 15, Number 3, 1981
- Andreas Brandstädt:
Closure Properties of Certain Families of Formal Languages with Respect to a Generalization of Cyclic Closure. ITA 15(3): 233-252 (1981)
Volume 15, Number 4, 1981
- Hermann A. Maurer, Arto Salomaa, Derick Wood:
Synchronized EOL Forms Under Uniform Interpretation. ITA 15(4): 337-353 (1981) - Jürgen Avenhaus, Klaus Madlener:
An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation. ITA 15(4): 335-371 (1981)
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-20 21:34 CEST by the dblp team