Descriptional Complexity of Formal Systems: 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25–27, 2018, Proceedings

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Workshop on Descriptional Complexity of Formal Systems

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-94631-3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Properties of Right One-Way Jumping Finite Automata

  2018cited by this paper
• On the Generation of 2-Polyominoes

  2018cited by this paper
• Cover Complexity of Finite Languages

  2018cited by this paper
• Word Problem Languages for Free Inverse Monoids

  2018cited by this paper
• State Grammars with Stores

  2018cited by this paper
• Error-Free Affine, Unitary, and Probabilistic OBDDs

  2018cited by this paper
• Two-Way Automata over Locally Finite Semirings

  2018cited by this paper
• Most Complex Deterministic Union-Free Regular Languages

  2017cited by this paper
• Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages

  2017influential reference
• Most Complex Non-returning Regular Languages

  2017influential reference
• A New Technique for Reachability of States in Concatenation Automata

  2017influential reference
• Operational State Complexity and Decidability of Jumping Finite Automata

  2017cited by this paper
• One-Way Jumping Finite Automata

  2016cited by this paper
• Language recognition power and succinctness of affine automata

  2016cited by this paper
• Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages

  2016influential reference
• Trees and Languages with Periodic Signature

  2016cited by this paper
• Unrestricted State Complexity of Binary Operations on Regular Languages

  2016influential reference
• Jumping Finite Automata: Characterizations and Complexity

  2015cited by this paper
• Combinatorial and probabilistic properties of systems of numeration

  2014cited by this paper
• Chapter 17 Jumping Finite Automata

  2014cited by this paper
• Quantum Finite Automata: A Modern Introduction

  2014influential reference
• State Complexity of Basic Operations on Non-Returning Regular Languages

  2013influential reference
• In Search of Most Complex Regular Languages

  2012influential reference
• Jumping Finite Automata

  2012cited by this paper
• On the concrete complexity of the successor function

  2012cited by this paper
• Abstract Numeration Systems

  2011cited by this paper
• Quotient Complexity of Star-Free Languages

  2010influential reference
• Complexity in Prefix-Free Regular Languages

  2010influential reference
• Operational State Complexity of Prefix-Free Regular Languages

  2009influential reference
• Quotient Complexity of Closed Languages

  2009influential reference
• On input-revolving deterministic and nondeterministic finite automata

  2009cited by this paper
• Combinatorics , Automata and Number Theory

  2009cited by this paper
• Quotient complexity of ideal languages

  2009influential reference
• Powers of rationals modulo 1 and rational base number systems

  2008cited by this paper
• State complexity of basic operations on suffix-free regular languages

  2007influential reference
• Quantum branching programs and space-bounded nonuniform quantum complexity

  2004cited by this paper
• Unary Language Operations, State Complexity and Jacobsthal's Function

  2002influential reference
• State Complexity of Regular Languages

  2001influential reference
• Analysis of Carry Propagation in Addition: An Elementary Approach

  2001cited by this paper
• A read-once lower bound and a (1, +k)-hierarchy for branching programs

  2000influential reference
• Average State Complexity of Operations on Unary Automata

  1999influential reference
• State Complexity of Basic Operations on Finite Languages

  1999influential reference
• Formal properties of natural language and linguistic theories

  1996cited by this paper
• Preliminary discussion of the logical design of an electronic computing instrument (1946)

  1989cited by this paper
• Branching Programs and Binary Deci-sion Diagrams-Theory and Applications

  1987cited by this paper
• The Average Time for Carry Propagation

  1978cited by this paper
• An Infinite Hierarchy of Context-Free Languages

  1969cited by this paper
• BOUNDED ALGOL-LIKE LANGUAGES^)

  1964cited by this paper
• Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors

  1913cited by this paper

• Quasi-deterministic 5' -> 3' Watson-Crick Automata

  2022influential citation
• State-deterministic 5 0 ! 3 0 Watson-Crick automata

  2021cites this paper
• State-deterministic $5'\rightarrow 3'$ Watson-Crick automata

  2021cites this paper
• On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducers

  2021cites this paper
• Two-way Nanoscale automata

  2020cites this paper
• DNA Computing - Foundations and Implications

  2012influential citation
• DNA Computing : Foundations and Implications ∗

  2010influential citation
• Theoretical Computer Science on the Descriptional Complexity of Watson–crick Automata

  year unknowncites this paper