Search results for "FCT"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Thomas Eiter, Georg Gottlob	The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic.	FCT	1997	DBLP DOI BibTeX RDF
1	Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire	Criteria to Disprove Context-Freeness of Collage Languages.	FCT	1997	DBLP DOI BibTeX RDF
1	Irina A. Lomazova	On Occurrence Net Semantics for Petri Nets with Contacts.	FCT	1997	DBLP DOI BibTeX RDF
1	Friedrich Otto, Andrea Sattler-Klein	FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems.	FCT	1997	DBLP DOI BibTeX RDF
1	Mikael Hammar, Bengt J. Nilsson	Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms.	FCT	1997	DBLP DOI BibTeX RDF
1	Éric Badouel, Philippe Darondeau	Stratified Petri Nets.	FCT	1997	DBLP DOI BibTeX RDF
1	Felipe Cucker, Klaus Meer	Logics Which Capture Complexity Classes over the Reals.	FCT	1997	DBLP DOI BibTeX RDF
1	Armin Kühnemann	A Two-Dimensional Hierarchy for Attributed Tree Transducers.	FCT	1997	DBLP DOI BibTeX RDF
1	Daniel A. Spielman	The Complexity of Error-Correcting Codes.	FCT	1997	DBLP DOI BibTeX RDF
1	Holger Petersen 0001	The Equivalence of Pebbles and Sensing Heads for Finite Automata.	FCT	1997	DBLP DOI BibTeX RDF
1	Eike Best, Thomas Thielke	Refinement of Coloured Petri Nets.	FCT	1997	DBLP DOI BibTeX RDF
1	Frank Stephan 0001, Sebastiaan Terwijn	The Complexity of Universal Text-Learners.	FCT	1997	DBLP DOI BibTeX RDF
1	Irina B. Virbitskaite, Anzhelika Votintseva	Behavioural Characterizations of Partial Order Logics.	FCT	1997	DBLP DOI BibTeX RDF
1	Bruno Martin	Cellular Automata Universality Revisited.	FCT	1997	DBLP DOI BibTeX RDF
1	Bogdan S. Chlebus, Ludwik Czaja (eds.)	Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Kraków, Poland, September 1-3, 1997, Proceedings	FCT	1997	DBLP DOI BibTeX RDF
1	Ulrich Hertrampf	Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria.	FCT	1997	DBLP DOI BibTeX RDF
1	Rakesh M. Verma	Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps.	FCT	1997	DBLP DOI BibTeX RDF
1	Krzysztof Ciebiera, Adam Malinowski	A Note on Broadcasting with Linearly Bounded Transmission Faults in Constant Degree Networks.	FCT	1997	DBLP DOI BibTeX RDF
1	Ulla Koppenhagen, Ernst W. Mayr	The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups.	FCT	1997	DBLP DOI BibTeX RDF
1	Damas P. Gruska	Bounded Concurrency.	FCT	1997	DBLP DOI BibTeX RDF
1	Sven Schuierer	Lower Bounds in On-Line Geometric Searching.	FCT	1997	DBLP DOI BibTeX RDF
1	Alexander Moshe Rabinovich, Boris A. Trakhtenbrot	From Finite Automata toward Hybrid Systems (Extended Abstract).	FCT	1997	DBLP DOI BibTeX RDF
1	Manfred Kudlek, Solomon Marcus, Alexandru Mateescu	Contextual Grammars with Distributed Catenation and Shuffle.	FCT	1997	DBLP DOI BibTeX RDF
1	Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel	Query Order in the Polynomial Hierarchy.	FCT	1997	DBLP DOI BibTeX RDF
1	Zenon Sadowski	On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP.	FCT	1997	DBLP DOI BibTeX RDF
1	Markus E. Nebel	On the Average Complexity of the Membership Problem for a Generalized Dyck Language.	FCT	1997	DBLP DOI BibTeX RDF
1	Christos Levcopoulos, Joachim Gudmundsson	A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract).	FCT	1997	DBLP DOI BibTeX RDF
1	Elizaveta A. Okol'nishnikova	On the Hierarchy of Nondeterministic Branching k-Programs.	FCT	1997	DBLP DOI BibTeX RDF
1	Eli Upfal	Stochastic Analysis of Dynamic Processes.	FCT	1997	DBLP DOI BibTeX RDF
1	Rolf Niedermeier, Klaus Reinhardt, Peter Sanders 0001	Towards Optimal Locality in Mesh-Indexings.	FCT	1997	DBLP DOI BibTeX RDF
1	Christian Choffrut, Leucio Guerra	Generalized Rational Relations and their Logical Definability.	FCT	1997	DBLP DOI BibTeX RDF
1	Erik de Haas	Categorial Graphs (Extended Abstract).	FCT	1995	DBLP DOI BibTeX RDF
1	Christoph W. Keßler, Thomas Rauber	Optimal Continguous Expression DAG Evaluations.	FCT	1995	DBLP DOI BibTeX RDF
1	Vladimiro Sassone	Axiomatizing Petri Net Concatenable Processes.	FCT	1995	DBLP DOI BibTeX RDF
1	Jos C. M. Baeten, Jan A. Bergstra	Discrete Time Process Algebra with Abstraction.	FCT	1995	DBLP DOI BibTeX RDF
1	Cristian Calude, Marius Zimand	Effective Category and Measure in Abstract Complexity Theory (Extended Abstract).	FCT	1995	DBLP DOI BibTeX RDF
1	Michael Bertol	Efficient Rewriting in Cograph Trace Monoids.	FCT	1995	DBLP DOI BibTeX RDF
1	Kim Guldstrand Larsen, Paul Pettersson, Wang Yi 0001	Model-Checking for Real-Time Systems.	FCT	1995	DBLP DOI BibTeX RDF
1	Bruno Durand 0001, Jacques Mazoyer	Growing Patterns in 1D Cellular Automata.	FCT	1995	DBLP DOI BibTeX RDF
1	Ngoc-Minh Lê	Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space (Extended Abstract).	FCT	1995	DBLP DOI BibTeX RDF
1	Horst Reichel (eds.)	Fundamentals of Computation Theory, 10th International Symposium, FCT '95, Dresden, Germany, August 22-25, 1995, Proceedings	FCT	1995	DBLP DOI BibTeX RDF
1	Manfred Kudlek, Alexandru Mateescu	Distributed Catenation and Chomsky Hierarchy.	FCT	1995	DBLP DOI BibTeX RDF
1	Javier Esparza	Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes.	FCT	1995	DBLP DOI BibTeX RDF
1	Gilles Barthe	A Simple Abstract Semantics for Equational Theories.	FCT	1995	DBLP DOI BibTeX RDF
1	Martin Kummer, Frank Stephan 0001	The Power of Frequency Computation (Extended Abstract).	FCT	1995	DBLP DOI BibTeX RDF
1	Roberto M. Amadio, Lone Leth Thomsen, Bent Thomsen	From a Concurrent Lambda-Calculus to the Pi-Calculus.	FCT	1995	DBLP DOI BibTeX RDF
1	Eric Rémila	Tiling with Bars and Satisfaction of Boolean Formulas.	FCT	1995	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Falk Nicolai	r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract).	FCT	1995	DBLP DOI BibTeX RDF
1	Klaus Reinhardt	On the Synchronization of Semi-Traces.	FCT	1995	DBLP DOI BibTeX RDF
1	Rolf Niedermeier, Peter Rossmanith	PRAM's Towards Realistic Parallelism: BRAM's.	FCT	1995	DBLP DOI BibTeX RDF
1	Anja Gronewold, Hans Fleischhack	Computing Petri Net Languages by Reductions.	FCT	1995	DBLP DOI BibTeX RDF
1	Kathleen Fisher, John C. Mitchell	A Delegation-based Object Calculus with Subtying.	FCT	1995	DBLP DOI BibTeX RDF
1	Maria C. F. Ferreira, Hans Zantema	Dummy Elimination: Making Termination Easier.	FCT	1995	DBLP DOI BibTeX RDF
1	Valentin M. Antimirov	Rewriting Regular Inequalities (Extended Abstract).	FCT	1995	DBLP DOI BibTeX RDF
1	Victor Chepoi, Feodor F. Dragan	On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract).	FCT	1995	DBLP DOI BibTeX RDF
1	Klaus-Dieter Schewe	Functional Sorts in Data Type Specifications: A Geometric Approach to Semantics.	FCT	1995	DBLP DOI BibTeX RDF
1	Giovanni Pighizzini	How Hard is to Compute the Edit Distance.	FCT	1995	DBLP DOI BibTeX RDF
1	Jan A. Bergstra, Gheorghe Stefanescu	Processes with Multiple Entries and Exits.	FCT	1995	DBLP DOI BibTeX RDF
1	Ioan I. Macarie, Mitsunori Ogihara	Properties of Probabilistic Pushdown Automata (Extended Abstract).	FCT	1995	DBLP DOI BibTeX RDF
1	Chaochen Zhou, Dang Van Hung, Xiaoshan Li	A Duration Calculus with Infinite Intervals.	FCT	1995	DBLP DOI BibTeX RDF
1	Hanna Klaudel, Elisabeth Pelz	Communication as Unification in the Petri Box Calculus.	FCT	1995	DBLP DOI BibTeX RDF
1	Ernst W. Mayr	On Polynomial Ideals, Their Complexity, and Applications.	FCT	1995	DBLP DOI BibTeX RDF
1	Thomas Chaboud	About Planar Cayley Graphs.	FCT	1995	DBLP DOI BibTeX RDF
1	G. S. Makanin, Habib Abdulrab, M. N. Maksimenko	Formal Parametric Equations.	FCT	1995	DBLP DOI BibTeX RDF
1	Holger Petersen 0001	Some Results Concerning Two-Dimensional Turing Machines and Finite Automata.	FCT	1995	DBLP DOI BibTeX RDF
1	Heinz Faßbender	Implementation of a UU-Algorithm for Primitive Recursive Tree Functions.	FCT	1995	DBLP DOI BibTeX RDF
1	Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis	Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs.	FCT	1995	DBLP DOI BibTeX RDF
1	Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel 0001	Restarting Automata.	FCT	1995	DBLP DOI BibTeX RDF
1	Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener	Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).	FCT	1995	DBLP DOI BibTeX RDF
1	Heinz Faßbender	Implementation of a Universal Unification Algorithm for Macro Tree Transducers.	FCT	1993	DBLP DOI BibTeX RDF
1	Robin Milner	An Action Structure for Synchronous pi-Calculus.	FCT	1993	DBLP DOI BibTeX RDF
1	Bruno Durand 0001	Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof.	FCT	1993	DBLP DOI BibTeX RDF
1	Torben Hagerup, Martin Maas 0003	Generalized Topological Sorting in Linear Time.	FCT	1993	DBLP DOI BibTeX RDF
1	Helmut Jürgensen, Stavros Konstantinidis	The Hierarchy of Codes.	FCT	1993	DBLP DOI BibTeX RDF
1	Sabine Kuske	A Maximum Path Length Pumping Lemma for Edge-Replacement Languages.	FCT	1993	DBLP DOI BibTeX RDF
1	Martin Dietzfelbinger	Simulations Between Different Models of Parallel Computers.	FCT	1993	DBLP DOI BibTeX RDF
1	Dang Van Hung, Tran Van Dung	On the Relation Between Firing Sequences and Processes of Petri Nets.	FCT	1993	DBLP DOI BibTeX RDF
1	Markus Holzer 0001, Klaus-Jörn Lange	On the Complexities of Linear LL(1) and LR(1) Grammars.	FCT	1993	DBLP DOI BibTeX RDF
1	Virgil Emil Cazanescu	Local Equational Logic.	FCT	1993	DBLP DOI BibTeX RDF
1	Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak 0001	Approximations with Axis-Aligned Rectangles (Extended Abstract).	FCT	1993	DBLP DOI BibTeX RDF
1	Zoltán Ésik (eds.)	Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings	FCT	1993	DBLP DOI BibTeX RDF
1	Arto Salomaa	Pattern Languages: Problems of Decidability and Generation.	FCT	1993	DBLP DOI BibTeX RDF
1	Hongzhong Wu	Synthesis of O(lg n) Testable Trees.	FCT	1993	DBLP DOI BibTeX RDF
1	Robert S. Maier 0001, René Schott	Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating Functions.	FCT	1993	DBLP DOI BibTeX RDF
1	Andreas Potthoff, Wolfgang Thomas	Regular Tree Languages Without Unary Symbols are Star-Free.	FCT	1993	DBLP DOI BibTeX RDF
1	Peter Ruzicka, Igor Prívara	On Tree Pattern Unification Problems.	FCT	1993	DBLP DOI BibTeX RDF
1	Kai Salomaa, Derick Wood, Sheng Yu 0001	Structural Equivalences and ET0L Grammars (Extended Abstract).	FCT	1993	DBLP DOI BibTeX RDF
1	Paul Fischer	Finding Maximum Convex Polygons.	FCT	1993	DBLP DOI BibTeX RDF
1	Hans Dietmar Gröger	Does Transitivity Help? On the Complexity of Poset Properties.	FCT	1993	DBLP DOI BibTeX RDF
1	Piotr Chrzastowski-Wachtel, Marek Raczunas	Liveness of Weighted Circuits and the Diophantine Problem of Frobenius.	FCT	1993	DBLP DOI BibTeX RDF
1	Maurice Margenstern	Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality.	FCT	1993	DBLP DOI BibTeX RDF
1	Masami Ito	Dense and Disjunctive Properties of Languages.	FCT	1993	DBLP DOI BibTeX RDF
1	Hans-Jörg Kreowski	Five Facets of Hyperedge Replacement Beyond Context-Freeness.	FCT	1993	DBLP DOI BibTeX RDF
1	Volker Diekert	Rewriting, Möbius Functions and Semi-Commutations.	FCT	1993	DBLP DOI BibTeX RDF
1	Mahesh Girkar, Robert Moll	Vector Sequence Analysis and Full Weak Safety for Concurrent Systems.	FCT	1993	DBLP DOI BibTeX RDF
1	Pavel Pudlák	AC0 Circuit Complexity.	FCT	1993	DBLP DOI BibTeX RDF
1	Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura	Formal Languages Consisting of Primitive Words.	FCT	1993	DBLP DOI BibTeX RDF
1	Ernest G. Manes	The Equational Theory of a Boolean Monad.	FCT	1993	DBLP DOI BibTeX RDF
1	Lane A. Hemachandra, Riccardo Silvestri	Easity Checked Self-Reducibility (Extended Abstract).	FCT	1993	DBLP DOI BibTeX RDF
1	Zsuzsanna Róka	One-way Cellular Automata on Cayley Graphs.	FCT	1993	DBLP DOI BibTeX RDF

Publications at "FCT"( http://dblp.L3S.de/Venues/FCT )