R70-23 Multi-Tape and Multi-Head Pushdown Automata

JOURNAL ARTICLE published July 1970 in IEEE Transactions on Computers

Authors: T. Kameda

State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters

JOURNAL ARTICLE published 3 September 2023 in Electronic Proceedings in Theoretical Computer Science

Authors: Benedek Nagy

Descriptional Complexity of Bounded Regular Languages

BOOK CHAPTER published 2016 in Descriptional Complexity of Formal Systems

Authors: Andrea Herrmann | Martin Kutrib | Andreas Malcher | Matthias Wendlandt

Traced communication complexity of cellular automata

JOURNAL ARTICLE published July 2011 in Theoretical Computer Science

Authors: Eric Goles | Pierre Guillon | Ivan Rapaport

The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings

JOURNAL ARTICLE published 25 June 2009 in Electronic Proceedings in Theoretical Computer Science

Authors: Fred Lunnon

Minimizing Finite Automata Is Computationally Hard

BOOK CHAPTER published 2003 in Developments in Language Theory

Authors: Andreas Malcher

Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata

BOOK CHAPTER published 2012 in Descriptional Complexity of Formal Systems

Authors: Friedrich Otto

Finite automata and computational complexity

BOOK CHAPTER published in Lecture Notes in Computer Science

Authors: Howard Straubing | Denis Thérien

Propositional Proof Complexity and Cellular Automata

BOOK CHAPTER published 11 April 2011 in Cellular Automata - Simplicity Behind Complexity

Authors: Stefano Cavagnetto

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages

BOOK CHAPTER published 2005 in Implementation and Application of Automata

Authors: Henning Bordihn | Markus Holzer | Martin Kutrib

The Complexity of Compressed Membership Problems for Finite Automata

JOURNAL ARTICLE published November 2014 in Theory of Computing Systems

Authors: Artur Jeż

On Simulation Cost of Unary Limited Automata

BOOK CHAPTER published 2015 in Descriptional Complexity of Formal Systems

Authors: Martin Kutrib | Matthias Wendlandt

Decidability of operation problems for T0L languages and subclasses

JOURNAL ARTICLE published March 2011 in Information and Computation

Authors: Henning Bordihn | Markus Holzer | Martin Kutrib

Monoidal Multi-Tape Automata and Finite-State Transducers

BOOK CHAPTER published 1 August 2019 in Finite-State Techniques

Circuit Complexity

BOOK CHAPTER published 1994 in Finite Automata, Formal Logic, and Circuit Complexity

Authors: Howard Straubing

Nodes Connected by Path Languages

BOOK CHAPTER published 2011 in Developments in Language Theory

Authors: Markus Holzer | Martin Kutrib | Ursula Leiter

Boosting Pushdown and Queue Machines by Preprocessing

BOOK CHAPTER published 2018 in Implementation and Application of Automata

Authors: Martin Kutrib | Andreas Malcher | Matthias Wendlandt

Finite Semigroups

BOOK CHAPTER published 1994 in Finite Automata, Formal Logic, and Circuit Complexity

Authors: Howard Straubing

Construction of minimal deterministic finite automata from biological motifs

JOURNAL ARTICLE published March 2011 in Theoretical Computer Science

Authors: Tobias Marschall

More on the Descriptional Complexity of Products of Finite Automata

BOOK CHAPTER published 2021 in Descriptional Complexity of Formal Systems

Authors: Markus Holzer | Christian Rauch