yusuke1997/dblp-id-title huggingface dataset:
An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal
A Full and Linear Index of a Tree for Tree Patterns
A General Framework for Sequential Grammars with Control Mechanisms
Compressibility of Finite Languages by Grammars
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
Two-Word Shuffle: Some Results
Descriptional Complexity of Deterministic Restarting Automata
Clusters of Repetition Roots Forming Prefix Chains
Gemmating P Systems are Computationally Complete with Four Membranes
Complexity of Two-Dimensional Rank-Reducing Grammars
On Two-Way Communication in Cellular Automata With a Fixed Number of Cells
State Complexity of Union and Intersection on Graph-Walking Automata
Kleene Star on Unary Regular Languages
CD Grammar Systems with Regular Start Conditions
State Complexity of Catenation and Reversal Combined with Star
Logical Analysis of Hybrid Systems - A Complete Answer to a Complexity Challenge
Partial Derivative Automaton for Regular Expressions with Shuffle
On the Generative Power of Quasiperiods
Commutative Regular Languages with Product-Form Minimal Automata
Language Operations with Regular Expressions of Polynomial Size
Nondeterminism Growth and State Complexity
Positive and Negative Proofs for Circuits and Branching Programs
A New Measure of Descriptional Complexity of Languages and Formal Power Series: Compactness
Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views
On Trace Languages Generated by (Small) Spiking Neural P Systems
On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances
State Complexity of Prefix-Free Regular Languages
Square, Power, Positive Closure, and Complementation on Star-Free Languages
On the Number of Distinct Languages Accepted by Finite Automata with n States
Operational Complexity: NFA-to-DFA Trade-Off
State Complexity of Finite Partial Languages
Tight Bounds for the State Complexity of Deterministic Cover Automata
A Close Analysis of the Subset Construction
Operations on Subregular Languages and Nondeterministic State Complexity
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
Multiple Concatenation and State Complexity (Extended Abstract)
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages
On the Descriptional Complexity of Finite Automata With Modified Acceptance Conditions
Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata
Context-Free Insertion-Deletion Systems
On Weight of Universal Insertion Grammars
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity
Union-Complexities of Kleene Plus Operation
Complexity Issues in Binding-Blocking Automata
Descriptional Complexity of Formal Systems - 22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020, Proceedings
On minimal context-free insertion-deletion systems
Template-Guided DNA Recombination
Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings
Descriptional Complexity Issues in Grammar Systems
NFAs bitstream-based random generation
Union and Intersection of Regular Languages and Descriptional Complexity
3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata
Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings
State Complexity of Star and Square of Union of k Regular Languages
Enumeration of Context-Free Languages and Related Structures
State Complexity Bounds for the Commutative Closure of Group Languages
On the descriptional complexity of soliton automata
On the Descriptional Complexity of Metalinear CD Grammar Systems
Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract)
On the Complexity of L-reachability
A Direct Construction of Finite State Automata for Pushdown Store Languages
On Restarting Automata with Window Size One
Operational State Complexity Revisited: The Contribution of Monsters and Modifiers
Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage
Size of Unary One-Way Multi-head Finite Automata
Compact Descriptions for Efficient Algorithms
Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings
7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings
The Kolmogorov complexity of infinite objects
State Complexity of Subtree-Free Regular Tree Languages
Self-Verifying Finite Automata and Descriptional Complexity
State Complexity of Unambiguous Operations on Deterministic Finite Automata
Finite Automata and Randomness
On the Representation of Finite Automata
Proper Dependency Grammars
Minimal and Reduced Reversible Automata
New Directions in State Complexity
Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses
A Note on Pushdown Automata Systems
On Synchronized Multitape and Multihead Automata
Quantum Queries on Permutations
Complexity Results for Prefix Grammars
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata
Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings
The Complexity of Languages Resulting from the Concatenation Operation
Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings
Incompatible Measures of Internal Contextual Grammars
Applications of Transducers in Independent Languages, Word Distances, Codes
Linear-Time Limited Automata
Lazy Regular Sensing
Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata
State Complexity of Prefix Distance of Subregular Languages
Hypercubes and Isometric Words Based on Swap and Mismatch Distance
State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components
9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007
Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals Are Computationally Complete
Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20 - 22, 2001. Preproceedings
Large NFA Without Mergeable States
State Complexity of Projection and Quotient on Unranked Trees
Relative Densities of Formal Languages
Descriptional complexities of grammars over alphabets with finite parameters
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets
A note on the descriptional complexity of CD grammar systems of finite index
On the Grammatical Complexity of Finite Languages
Matter and Anti-Matter in Membrane Systems
Transition Complexity of Language Operations
Succinctness in Quantum Information Processing
Quantum State Complexity of Formal Languages
On Internal Contextual Grammars with Subregular Selection Languages
Union-Freeness, Deterministic Union-Freeness and Union-Complexity
Exact Generation of Minimal Acyclic Deterministic Finite Automata
From Ultrafilters on Words to the Expressive Power of a Fragment of Logic
Two-Way Finite Automata with Translucent Input Letters
Watson-Crick automata: determinism and state complexity
On the Descriptional Complexity of the Direct Product of Finite Automata
Limited Automata and Regular Languages
Descriptional Complexity of Iterated Uniform Finite-State Transducers
Descriptional Complexity of Error/Edit Systems
Determinism without Determinization
On the Decidability and Expressive Power of Several Theories Based on String Constraints
Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity
On One-Way Cellular Automata with a Fixed Number of Cells
Computational Completeness of Hybrid Networks of Evolutionary Processors with Seven Nodes
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting Schemas
Square on Deterministic, Alternating, and Boolean Finite Automata
Non-recursive Trade-offs between Two-Dimensional Automata and Grammars
Minimal DFA for Symmetric Difference NFA
Some formal methods for analyzing quantum automata
On the Descriptional Complexity of Deterministic Ordered Restarting Automata
State Complexity of Inversion Operations
On P Systems Operating in Sequential Mode
A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words
The Complexity of Las Vegas Automata Problems
State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism
Can Chimps Go It Alone?
How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l?
Nearly k-Universal Words - Investigating a Part of Simon's Congruence
A Characterisation of NL/poly via Nondeterministic Finite Automata
On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages
Star-Free Languages and Local Divisors
Concise Representations of Reversible Automata
MSO-definable Properties of Muller Context-Free Languages Are Decidable
Reset Complexity and Completely Reachable Automata with Simple Idempotents
Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity
An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity
Quantum Automata for some Multiperiodic Languages
State Complexity of Unary SV-XNFA with Different Acceptance Conditions
Regular Expressions: New Results and Open Problems
Production Complexity of Some Operations on Context-Free Languages
On the Uniform Distribution of Regular Expressions
On the State Complexity of the Shuffle of Regular Languages
Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton
State Complexity of Simple Splicing
The Consequences of Eliminating NP Solutions
Synchronization Functions of Synchronized Context-Free Grammars and Languages
Aperiodic Tilings by Right Triangles
The Limitedness Problem on Distance Automata
Decidability and Shortest Strings in Formal Languages
8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings
Properties of Right One-Way Jumping Finite Automata
On Jaffe's Pumping Lemma, Revisited
A Small Universal Antiport P System with Forbidden Context
State Complexity of Basic Operations on Non-returning Regular Languages
On the Number of Rules in Components of Cooperating Distributed Grammar Systems with Probabilities
Improved Constructions for Succinct Affine Automata
Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities
Upper Bound on Syntactic Complexity of Suffix-Free Languages
A Frontier Result on Enhanced Time-Varying Distributed H Systems with Parallel Computations
10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008
Most Complex Non-returning Regular Languages
Groups and Automata: A Perfect Match
State complexity of cyclic shift
A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]
Classifying ømega-Regular Aperiodic k-Partitions
Contextual Array Grammars with Matrix and Regular Control
On the Power of Recursive Word-Functions Without Concatenation
Follow Automaton versus Equation Automaton
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups
Nondeterministic State Complexity of Proportional Removals
Integer Complexity: Experimental and Analytical Results II
Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings
Descriptional Complexity of Generalized Forbidding Grammars
On the Number of Active Symbols in Lindenmayer Systems
Operational Complexity of Straight Line Programs for Regular Languages
Büchi automata and their degrees of nondeterminism and ambiguity
Shortest Repetition-Free Words Accepted by Automata
Leftmost Rewriting Tissue P Systems
Non-regularity, Approximation and State Complexity
An Infinite Hierarchy Induced by Depth Synchronization
Generalized de Bruijn Words and the State Complexity of Conjugate Sets
Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle
Error-Free Affine, Unitary, and Probabilistic OBDDs
A New Technique for Reachability of States in Concatenation Automata
Word-Representable Graphs and Locality of Words
State Complexity of Suffix Distance
On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems
On active symbols in CD grammar systems
NFA-to-DFA Trade-Off for Regular Operations
Descriptional Complexity and Operations - Two Non-classical Cases
Approximate NFA Universality Motivated by Information Theory
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete
The Size of Higman-Haines Sets
Regular Approximations of Non-Regular Languages
On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars
On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars
Descriptional Complexity of Regular Languages (Concepts and Open Problems)
State Complexity and Limited Nondeterminism
The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages
Prefix-Free Subsets of Regular Languages and Descriptional Complexity
Descriptional Complexity of Matrix Simple Semi-conditional Grammars
Operational State Complexity under Parikh Equivalence
Descriptional Complexity of Eco-Grammar Systems
Two Results on Discontinuous Input Processing
On the Descriptional Power of Heads, Counters, and Pebbles
The Word Problem for Finitary Automaton Groups
Representation of Semiautomata by Canonical Words and Equivalences
Reset Complexity of Ideal Languages Over a Binary Alphabet
A Complete Characterization of Deterministic Regular Liveness Properties
Efficient Computation of Regular Expressions from Unary NFAs
(Non)determinism and the Size of One-Way Finite Automata
Estimation of State Complexity of Combined Operations
Palindromic Length of Words with Many Periodic Palindromes
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets
Remarks on Separating Words
Some Remarks on Primitive Words and Palindromes
State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages
Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal
Deterministic moles cannot solve liveness
Complement on Free and Ideal Languages
On Contextual Grammars with Subregular Selection Languages
5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12 - 14, 2003. Proceedings
On the Computational Complexity of Problems Related to Distinguishability Sets
Succinct Representations of Languages by DFA With Different Levels of Reliability
On the Descriptional Complexity of External Hybrid Cooperating Distributed Grammar Systems
Invertible Transductions and Iteration
On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words
Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2 n Lower Bound
Reversal on Regular Languages and Descriptional Complexity
Nondeterministic Tree Width of Regular Languages
Cycles and Global Attractors of Reaction Systems
Kleene Theorems for Product Systems
The Descriptional Power of Sublogarithmic Resource Bounded Turing Machines
Queue Automata of Constant Length
Geometrical Regular Languages and Linear Diophantine Equations
On leftmost #-Rewriting Systems
Random DFAs over a Non-Unary Alphabet
Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter
Construction and SAT-Based Verification of Contextual Unfoldings
Exact Generation of Acyclic Deterministic Finite Automata
Regularity and Size of Set Automata
Reducing Cover Subsequential Transducers
State Complexity of Regular Tree Languages for Tree Pattern Matching
Branching Measures and Nearly Acyclic NFAs
State Complexity of NFA to DFA Conversion of Subregular Language Families
On Descriptions of Context-Free Languages by CD Grammar Systems
On Simon's Congruence Closure of a String
Improved Normal Form for Grammars with One-Sided Contexts
On the State Complexity of the Reverse of - and -Trivial Regular Languages
From k + 1 to k heads the descriptive trade-off is non-recursive
Descriptional Complexity of Winning Sets of Regular Languages
Existential and Universal Width of Alternating Finite Automata
Unary Self-verifying Symmetric Difference Automata
Descriptional Complexity of Block-Synchronization Context-Free Grammars
Finite Codes over Free Binoids
Pushdown Information
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
Lower bounds for NFA to DCFA Transformations
On the Complexity of a Problem on Monadic String Rewriting Systems
The Phenomenon of Non-Recursive Trade-Offs
Syntactic Complexities of Some Classes of Star-Free Languages
Square on Ideal, Closed and Free Languages
Restarting Automata and Variants of j-Monotonicity
State Complexity of Projected Languages
Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings
Gray Cycles of Maximum Length Related to k-Character Substitutions
Descriptional Complexity of Partially Parallel Grammars
Complementing Unary Nondeterministic Automata
Measuring privacy loss in statistical databases
Some Separation Results Between Classes of Pointer Algorithms
Wireless Parallel Computing and its Links to Descriptive Complexity
Automating Implementation of Business Logic of Multi Subject-Domain IS on the Base of Machine Learning, Data Programming and Ontology-Based Generation of Labeling Functions
From Models_For_Programming to Modelling_To_Program and Towards Models_As_A_Program
A Models-to-Program Information Systems Engineering Method
Models Versus Model Descriptions
Modelling to Program - Second International Workshop, M2P 2020, Lappeenranta, Finland, March 10-12, 2020, Revised Selected Papers
Conceptual Model Reuse for Problem Solving in Subject Domains
Formal Model Checking and Transformations of Models Represented in UML with Alloy
Modeling and Implementing of Industrie 4.0 Scenarios
Structurally Recursive Patterns in Data Modeling and Their Resolution
Applying Model-Driven Approach for Data Model Unification
Agile Generator-Based GUI Modeling for Information Systems
How to Catch a Moonbeam: From Model-Ware to Component-Ware Software Product Engineering
MarkiS: A Marketing Intelligent System Software Application for Causal Modeling
Designing Lines of Cars That Optimize the Degree of Differentiation vs. Commonality among Models in the Line: A Natural Intelligence Approach
ContextCare: Autonomous Video Surveillance System Using Multi-camera and Smartphones
Distributed Cognition Learning in Collaborative Civil Engineering Projects Management
A News-Based Approach for Computing Historical Value-at-Risk
Non-parametric Statistical Analysis of Machine Learning Methods for Credit Scoring
Integration of a Proximity Detection Prototype into a VO Developed with PANGEA
Clustering of Fuzzy Cognitive Maps for Travel Behavior Analysis
Improving Customer Churn Prediction by Data Augmentation Using Pictorial Stimulus-Choice Data
Hybrid Genetic-Fuzzy System Modeling Application in Innovation Management
A Linguistic Approach for Semantic Web Service Discovery
Reduced Large Datasets by Fuzzy C-Mean Clustering Using Minimal Enclosing Ball
Semantic Web Mining for Book Recommendation
Developing Anti-spam Filters Using Automatically Generated Rough Sets Rules
Applying Multi-objective Optimization for Variable Selection to Analyze User Trust in Electronic Banking
Rule-Based Business Process Mining: Applications for Management
Approximating the Pareto-front of Continuous Bi-objective Problems: Application to a Competitive Facility Location Problem
Smart Objects System: A Generic System for Enhancing Operational Control
Using Data Mining and Vehicular Networks to Estimate the Severity of Traffic Accidents
A Multiple-Agent Based System for Forecasting the Ice Cream Demand Using Climatic Information
Impact of Initial Tuning for Algorithm That Solve Query Routing
A Case-Based Planning Mechanism for a Hardware-Embedded Reactive Agents Platform
An Automated Approach to Product Taxonomy Mapping in E-Commerce
Visualization of Agents and Their Interaction within Dynamic Environments
Prosaico: An Intelligent System for the Management of a Sports Facility
A Context-Aware Mobile Recommender System Based on Location and Trajectory
Automatic Extraction of the Real Organizational Hierarchy Using JADE
A Strategic Perspective on Management Intelligent Systems
A Statistical Approach to Star Rating Classification of Sentiment
Gaussian Mixture Models vs. Fuzzy Rule-Based Systems for Adaptive Meta-scheduling in Grid/Cloud Computing
Management Intelligent Systems - First International Symposium, IS-MiS 2012, Salamanca, Spain, July 11-13, 2012
Manual Intervention and Statefulness in Agent-Involved Workflow Management Systems
The Migrant Integration Platform MICADO - A Tool for Social Integration and Cohesion
Rethinking Democracy in the "Pandemic Society" A Journey in Search of the Governance with, of and by AI
Proceedings of the Second International Forum on Digital and Democracy November 17-18, 2022, live and digital event in Rome, Italy, November 17-18, 2022, live and digital event in Rome, Italy
Access to Scientific Information and Knowledge: A Matter of Democracy
A Blockchain-driven E-participation for Substantial Democracy
The Challenges of Urban Data Ethics: Big Data and Intelligent Systems to Support Decision
Proceedings of the First International Forum on Digital and Democracy. Towards A Sustainable Evolution 2020, Venice, Italy, December 10-11, 2020
Artificial Intelligence Against Disinformation: The FANDANGO Practical Case (short paper)
The art of Technology Diplomacy: Strategic Reflections on the Implications of Digital Technologies on Democracy
Artificial Intelligence Research for Fighting Political Polarisation: A Research Agenda
Digital Social Contracts: A Foundation for an Egalitarian and Just Digital Society
"Algocracy": The Decline of Representative Democracy (short paper)
Legality, Legitimacy, and Instrumental Possibility in Human and Computational Governance for the Public Sector
Legal Knowledge Representation in the Domain of Private International Law?
Democracy in the Digital Revolution (short paper)
Countering Russian Misinformation, Disinformation, Malinformation and Influence Campaigns in Italy Surrounding the Russian Invasion of Ukraine
Public Space & Social Media: New Possibilities of Politicization, "Echo Chambers" or Fora of Neo-populism?
Towards understanding user tolerance to network latency and data rate in remote viewing of progressive meshes
Network and Operating System Support for Digital Audio and Video, 5th International Workshop, NOSSDAV '95, Durham, New Hampshire, USA, April 19-21, 1995, Proceedings
GSVC: Efficient Video Representation and Compression Through 2D Gaussian Splatting
Media-friendliness of a slowly-responsive congestion control protocol
Peer-assisted online storage and distribution: modeling and server strategies