Skip to content
cs-conference-ranking.org

International Symposium on Fundamentals of Computation Theory

FCT

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

1,086

1977–2025

Best Theory of Computation conferences

Papers per year

1977110 peak2025

Most published authors

FCT papers

1,086 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1981On Cellular Graph-Automata and Second-Order Definable Graph-Properties.Gyrgy Turn
1981Pebbling and Bandwith.Ivan Hal Sudborough
1981Some Algebraic Aspects of Recognizability and Rationality.Magnus Steinby
1981Processes in Petri Nets.Peter H. Starke
1981Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures.Detlef Seese
1981First Order Dynamic Logic with Decidable Proofs and Workable Model Theory.Ildik Sain
1981On Subwords of Formal Languages.Grzegorz Rozenberg
1981On the Size of Conjunctive Representations of n-ary Relations.Ales Pultr
1981Remarks on the Notion of Concurrency Relation in the Case of Systems.Piotr W. Prszynski
1981Context-Free Languages of Infinite Words As Least Fixpoints.Axel Poign
1981The Equivalence Problem for LL- and LR-Regular Grammars.Anton Nijholt
1981Dynamic Algebras of Programs.Istvn Nmeti
1981The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics.Andrzej Wlodzimierz Mostowski
1981On the LBA Problem.Burkhard Monien
1981Co-Algebras as Machines for the Interpretations of Flow Diagrams.Wolfgang Merzenich
1981About the by Codings of Environments Induced Posets [aChristoph Meinel
1981On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars.Matti Linna
1981Rational Cone and Substitution.Jeannine Leguy
1981Reducing Algebraic Tree Grammars.Bernard Leguy
1981Isomorphism Completeness for Some Algebraic Structures.Ludek Kucera, Vera Trnkov
1981Some Properties of Language Families Generated by Commutative Languages.Juha Kortelainen
1981Mathematical Structures Underlying Greedy Algorithms.Bernhard Korte, Lszl Lovsz
1981On the Role of Selectors in Selective Substitution Grammars.H. C. M. Kleijn, Grzegorz Rozenberg
1981On Strongly Cube-Free Omega-Words Generated by Binary Morphisms.Juhani Karhumki
1981What is Computable for Abstract Data Types?Heinz Kaphengst
926–950 of 1,086← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.