Kai Salomaa

IEEE Open J. Commun. Soc., 2024

Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface.

[BibT_eX]

[DOI]

Zoltán Fülöp

George Rahonis

Int. J. Found. Comput. Sci., 2024

2023

On Simon's congruence closure of a string.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

The nondeterministic state complexity of the site-directed deletion language operation.

[BibT_eX]

[DOI]

Oliver A. S. Lyon

Theor. Comput. Sci., August, 2023

Deciding path size of nondeterministic (and input-driven) pushdown automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2023

Maximal Existential and Universal Width.

[BibT_eX]

[DOI]

Casey Keeler

Sci. Ann. Comput. Sci., 2023

Descriptional Complexity of Finite Automata - Selected Highlights.

[BibT_eX]

[DOI]

CoRR, 2023

Balancing Matching of Two-Sided Agents with Adaptive and Fair Instability.

[BibT_eX]

[DOI]

Peash Ranjan Saha

Proceedings of the IEEE Symposium Series on Computational Intelligence, 2023

Quantum Neural Networks driven Stochastic Resource Optimization for Metaverse Data Marketplace.

[BibT_eX]

[DOI]

Proceedings of the 9th IEEE International Conference on Network Softwarization, 2023

Multi-Objective Task Assignment Solution for Parked Vehicular Computing.

[BibT_eX]

[DOI]

Jia He Sun

Proceedings of the 12th International Conference on Operations Research and Enterprise Systems, 2023

Quantum Computing Empowered Metaverse: An Approach for Resource Optimization.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2023

On the Simon's Congruence Neighborhood of Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Existential and Universal Width of Alternating Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022

An online fair resource allocation solution for fog computing.

[BibT_eX]

[DOI]

Jia He Sun

Int. J. Parallel Emergent Distributed Syst., 2022

Nondeterministic State Complexity of Site-Directed Insertion.

[BibT_eX]

[DOI]

Oliver A. S. Lyon

J. Autom. Lang. Comb., 2022

Structural properties of NFAs and growth rates of nondeterminism measures.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Nondeterministic State Complexity of Site-Directed Deletion.

[BibT_eX]

[DOI]

Oliver A. S. Lyon

Proceedings of the Implementation and Application of Automata, 2022

A Two-Stage Based Strategy to Optimize Homeless Placement in Shelters.

[BibT_eX]

[DOI]

Peash Ranjan Saha

Proceedings of the IEEE International Humanitarian Technology Conference, 2022

Resource Optimization of SFC Embedding for IoT Networks Using Quantum Computing.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, 2022

2021

Decision problems and projection languages for restricted variants of two-dimensional automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Closest substring problems for regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Generalizations of Code Languages with Marginal Errors.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

Consensus string problem for multiple regular languages.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Degrees of Restriction for Two-Dimensional Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2021

Concatenation Operations and Restricted Variants of Two-Dimensional Automata.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Width Measures of Alternating Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2021

2020

Alternating Finite Automata with Limited Universal Branching.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2020

Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019

Improved Recruitment Algorithms for Vehicular Crowdsensing Networks.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2019

Further closure properties of input-driven pushdown automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Edit distance neighbourhoods of input-driven pushdown automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Site-directed insertion: Language equations and decision problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Localized algorithms for redundant readers elimination in RFID networks.

[BibT_eX]

[DOI]

Nafiul Rashid

Int. J. Parallel Emergent Distributed Syst., 2019

State Complexity of the Quotient Operation on Input-Driven Pushdown Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

State Complexity of Suffix Distance.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Branching Measures and Nearly Acyclic NFAs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Decision Problems for Restricted Variants of Two-Dimensional Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2019

The Relative Edit-Distance Between Two Input-Driven Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

Nondeterminism Growth and State Complexity.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2019

Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Growth Rate of Minimum Branching.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

State Complexity of Neighbourhoods and Approximate Pattern Matching.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Routing in a polygonal terrain with the shortest beacon watchtower.

[BibT_eX]

[DOI]

Bahram Kouhestani

Comput. Geom., 2018

Site-Directed Deletion.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Cycle Height of Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2018

Site-Directed Insertion: Decision Problems, Maximality and Minimality.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017

State complexity of prefix distance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Outfix-guided insertion.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Pseudoknot-generating operation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

State complexity of permutation on finite languages over a binary alphabet.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

State complexity of operations on input-driven pushdown automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

State Complexity of Prefix Distance of Subregular Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Worst Case Branching and Other Measures of Nondeterminism.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2017

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2017

State Complexity of k-Parallel Tree Concatenation.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Report on the Magic in Science symposium.

[BibT_eX]

[DOI]

Andrew L. Szilard

Bull. EATCS, 2017

Ambiguity, Nondeterminism and State Complexity of Finite Automata.

[BibT_eX]

[DOI]

Acta Cybern., 2017

Relative Prefix Distance Between Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

The Quotient Operation on Input-Driven Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2017

Quasi-Distances and Weighted Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Role of Theory in Computer Science, 2017

2016

Operational state complexity of unary NFAs with finite nondeterminism.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

State complexity of inversion operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Pseudo-inversion: closure properties and decidability.

[BibT_eX]

[DOI]

Nat. Comput., 2016

Duplications and Pseudo-Duplications.

[BibT_eX]

[DOI]

Da-Jung Cho

Hwee Kim

Int. J. Unconv. Comput., 2016

State Complexity of Insertion.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Approximate matching between a context-free grammar and a finite-state automaton.

[BibT_eX]

[DOI]

Inf. Comput., 2016

State complexity of deletion and bipolar deletion.

[BibT_eX]

[DOI]

Acta Informatica, 2016

CARRE: Cellular automaton based redundant readers elimination in RFID networks.

[BibT_eX]

[DOI]

Nafiul Rashid

Proceedings of the 2016 IEEE International Conference on Communications, 2016

Outfix-Guided Insertion - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

The Length of the Beacon Attraction Trajectory.

[BibT_eX]

Bahram Kouhestani

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Descriptional complexity of unambiguous input-driven pushdown automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2015

Cellular Automaton Based Localized Algorithms for Mobile Sensor Networks.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2015

State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages.

[BibT_eX]

[DOI]

Hae-Sung Eom

Int. J. Found. Comput. Sci., 2015

State Complexity of Kleene-Star Operations on Regular Tree Languages.

[BibT_eX]

[DOI]

Acta Cybern., 2015

Cellular automata and object monitoring in mobile wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Wireless Communications and Networking Conference, 2015

The State Complexity of Permutations on Finite Languages over Binary Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2015

Nondeterministic Tree Width of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2015

On the Inverse Beacon Attraction Region of a Point.

[BibT_eX]

[DOI]

Bahram Kouhestani

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Complexity of input-driven pushdown automata.

[BibT_eX]

[DOI]

SIGACT News, 2014

Cellular automaton-based algorithms for the dispersion of mobile wireless sensor networks.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2014

Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

Nondeterministic State Complexity of Proportional Removals.

[BibT_eX]

[DOI]

Daniel Goc

Int. J. Found. Comput. Sci., 2014

Pseudo-inversion on Formal Languages.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2014

Unary NFAs with Limited Nondeterminism.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Top-Down Tree Edit-Distance of Regular Tree Languages.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2014

Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

State Complexity of Deletion.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Computation Width and Deviation Number.

[BibT_eX]

[DOI]

Daniel Goc

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Cellular automata and Mobile Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 27th Canadian Conference on Electrical and Computer Engineering, 2014

State Complexity of Combined Operations for Prefix-Free Regular Languages.

[BibT_eX]

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012.

[BibT_eX]

[DOI]

Andrew L. Szilard

Int. J. Found. Comput. Sci., 2013

The Edit-Distance between a Regular Language and a Context-Free Language.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Undecidability of state complexity.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

Input-driven pushdown automata: nondeterminism and unambiguity.

[BibT_eX]

Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

Finite Nondeterminism vs. DFAs with Multiple Initial States.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

Comparisons between Measures of Nondeterminism on Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages.

[BibT_eX]

[DOI]

Hae-Sung Eom

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

Lower bounds for the size of deterministic unranked tree automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

State complexity of the concatenation of regular tree languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes.

[BibT_eX]

[DOI]

David Sears

Nat. Comput., 2012

A Cellular Automaton Model for Wireless Sensor Networks.

[BibT_eX]

[DOI]

J. Cell. Autom., 2012

State Complexity of Finite Tree Width NFAs.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2012

State-Size Hierarchy for Finite-State Complexity.

[BibT_eX]

[DOI]

Cristian S. Calude

Tania Roblot

Int. J. Found. Comput. Sci., 2012

Sheng Yu (1950-2012) In Memoriam.

[BibT_eX]

[DOI]

Andrew L. Szilard

Fundam. Informaticae, 2012

In Memoriam Sheng Yu.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2012

Energy efficient cellular automaton based algorithms for mobile wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Natural Computing, 2012

Cellular automaton based algorithms for depth adjustment in underwater mobile sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 9th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, 2012

A cellular automaton model for connectivity preserving deployment of mobile wireless sensors.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2012

Computing the Edit-Distance between a Regular Language and a Context-Free Language.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

State Complexity of Projection and Quotient on Unranked Trees.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2012

State Complexity and Limited Nondeterminism.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2012

State Complexity of Kleene-Star Operations on Trees.

[BibT_eX]

[DOI]

Proceedings of the Computation, Physics and Beyond, 2012

Descriptional Complexity of Input-Driven Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Languages Alive, 2012

2011

Finite state complexity.

[BibT_eX]

[DOI]

Cristian S. Calude

Tania Roblot

Theor. Comput. Sci., 2011

Editorial: Computing with biomolecules.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

Nat. Comput., 2011

Overlap-Free Languages and solid Codes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Limitations of lower bound methods for deterministic nested word automata.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Transformations Between Different Models of Unranked Bottom-Up Tree Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Transition Complexity of Incomplete DFAs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Extended Watson-Crick L Systems with Regular Trigger Languages.

[BibT_eX]

[DOI]

David Sears

Proceedings of the Unconventional Computation - 10th International Conference, 2011

Undecidability of the State Complexity of Composed Regular Operations.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Descriptional Complexity of Unambiguous Nested Word Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

State Trade-Offs in Unranked Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

On Language Decompositions and Primality.

[BibT_eX]

[DOI]

Proceedings of the Rainbow of Computer Science, 2011

Tree Homomorphisms for Unranked Trees.

[BibT_eX]

Sándor Vágvölgyi

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010

Analysis of a cellular automaton model for car traffic with a slow-to-stop rule.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Orthogonal Concatenation: Language Equations and State Complexity.

[BibT_eX]

[DOI]

Mark Daley

J. Univers. Comput. Sci., 2010

An Improved Cellular Automata Based Algorithm for the 45-Convex Hull Problem.

[BibT_eX]

[DOI]

J. Cell. Autom., 2010

Finite-State Complexity and the Size of Transducers

[BibT_eX]

[DOI]

Tania Roblot

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Nondeterministic State Complexity for Suffix-Free Regular Languages

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Transformations Between Different Types of Unranked Bottom-Up Tree Automata

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Operational State Complexity of Deterministic Unranked Tree Automata

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

2009

Deciding determinism of caterpillar expressions.

[BibT_eX]

[DOI]

Jinfeng Zan

Theor. Comput. Sci., 2009

Operational state complexity of nested word automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Nondeterministic state complexity of nested word automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

State complexity of basic operations on suffix-free regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the descriptional complexity of Watson-Crick automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the synchronized derivation depth of context-free grammars.

[BibT_eX]

[DOI]

Franziska Biegler

Theor. Comput. Sci., 2009

Variants of codes and indecomposable languages.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2009

State Complexity of Nested Word Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

State Complexity of Combined Operations for Prefix-Free Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

A Cryptosystem Based on the Composition of Reversible Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Operational State Complexity of Prefix-Free Regular Languages.

[BibT_eX]

Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008

Lower bounds for the transition complexity of NFAs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

State Complexity of Union and Intersection of Finite Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Language Decompositions, Primality, and Trajectory-Based Operations.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Applications of Automata, 2008

Length Codes, Products of Languages and Primality.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

State Complexity of Orthogonal Catenation.

[BibT_eX]

Mark Daley

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

Watson-Crick automata: determinism and state complexity.

[BibT_eX]

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

State complexity of combined operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the existence of prime decompositions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Transition complexity of language operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the existence of regular approximations.

[BibT_eX]

[DOI]

Brendan J. Cordy

Theor. Comput. Sci., 2007

An infinite hierarchy induced by depth synchronization.

[BibT_eX]

[DOI]

Franziska Biegler

Ian McQuillan

Theor. Comput. Sci., 2007

On the State Complexity of Combined Operations and their Estimation.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

State Complexity of Additive Weighted Finite Automata.

[BibT_eX]

[DOI]

Paul N. Schofield

Int. J. Found. Comput. Sci., 2007

Intercode Regular Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Deterministic Caterpillar Expressions.

[BibT_eX]

[DOI]

Jinfeng Zan

Proceedings of the Implementation and Application of Automata, 2007

Descriptional Complexity of Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Codes defined by multiple sets of trajectories.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Interpreted Trajectories.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Fundam. Informaticae, 2006

Prime Decompositions of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

State Complexity of Prefix-Free Regular Languages.

[BibT_eX]

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

State Complexity of Catenation and Reversal Combined with Star.

[BibT_eX]

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

Regular Approximations of Non-Regular Languages.

[BibT_eX]

Brendan J. Cordy

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

Iterated TGR Languages: Membership Problem and Effective Closure Properties.

[BibT_eX]

[DOI]

Ian McQuillan

Mark Daley

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Decidability of trajectory-based equations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Restricted sets of trajectories and decidability of shuffle decompositions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Contextual Grammars with Uniform Sets of Trajectories.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

2004

State Complexity of Shuffle on Trajectories.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2003

A Formal Study Of Practical Regular Expressions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

2002

Decidability of EDT0L structural equivalence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Additive Distances and Quasi-Distances Between Words.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

Tight Lower Bound for the State Complexity of Shuffle of Regular Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

Shuffle Decompositions of Regular Languages.

[BibT_eX]

[DOI]

Sándor Vágvölgyi

Int. J. Found. Comput. Sci., 2002

One-Visit Caterpillar Tree Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

Regex and Extended Regex.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2002

2001

On the State Complexity of k-Entry Deterministic Finite Automata.

[BibT_eX]

[DOI]

Markus Holzer

J. Autom. Lang. Comb., 2001

A sharpening of the Parikh mapping.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2001

Shuffle Quotient and Decompositions.

[BibT_eX]

[DOI]

Sándor Vágvölgyi

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

Alternating finite automata and star-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata.

[BibT_eX]

[DOI]

Xiuming Wu

Theor. Comput. Sci., 2000

On Fairness of Many-Dimensional Trajectories.

[BibT_eX]

[DOI]

Alexandru Mateescu

J. Autom. Lang. Comb., 2000

State Complexity of Regular Languages: Finite versus Infinite.

[BibT_eX]

[DOI]

Proceedings of the Finite Versus Infinite, 2000

1999

Synchronization Expressions and Languages.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1999

Generalized Fairness and Context-Free Languages.

[BibT_eX]

[DOI]

Acta Cybern., 1999

State Complexity of Basic Operations on Finite Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1999

Metric Lexical Analysis.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1999

Synchronization Expressions: Characterization Results and Implementation.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

Synchronization Expressions with Extended Join Operation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

On the Size of Stack and Synchronization Alphabets of Tree Automata.

[BibT_eX]

[DOI]

George Rahonis

Fundam. Informaticae, 1998

Implementing Reversed Alternating Finite Automaton (r-AFA) Operations.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1998

1997

NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1997

Semantics of Nonsequential Tree-Based Computation Schemes.

[BibT_eX]

[DOI]

Andrzej Ehrenfeucht

Grzegorz Rozenberg

Fundam. Informaticae, 1997

Efficient Implementation of Regular Languages Using R-AFA.

[BibT_eX]

[DOI]

Xiuming Wu

Proceedings of the Automata Implementation, 1997

Hierarchies of synchronized and algebraic forests.

[BibT_eX]

George Rahonis

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Decidability of fairness for context-free languages.

[BibT_eX]

Alexandru Mateescu

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Rewriting Rules for Synchronization Languages.

[BibT_eX]

[DOI]

Proceedings of the Structures in Logic and Computer Science, 1997

Block-Synchronization Context-Free Grammars.

[BibT_eX]

Helmut Jürgensen

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996

Structural Equivalence and ET0L Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Decidability of Equivalence for Deterministic Synchronized Tree Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

On the Modularity of Decidability of Completeness and Termination.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1996

Yield-Languages of Two-Way Pushdown Tree Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

On Synchronization Languages.

[BibT_eX]

[DOI]

Lifu Guo

Fundam. Informaticae, 1996

NFA to DFA Transformation for Finite Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1996

EDTOL Structural Equivalence is Decidable.

[BibT_eX]

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

P, NP and the Post Correspondence Problem

[BibT_eX]

[DOI]

Inf. Comput., September, 1995

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

Decision Problems for Patterns.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Complexity of E0L Structural Equivalence.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

Nondeterminism Degrees for Context-Free Languages.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

1994

The State Complexities of Some Basic Operations on Regular Languages.

[BibT_eX]

[DOI]

Qingyu Zhuang

Theor. Comput. Sci., 1994

Synchronized Tree Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Transducers and the Decidability of Independence in Free Monoids.

[BibT_eX]

[DOI]

Helmut Jürgensen

Theor. Comput. Sci., 1994

Semantics of Trees.

[BibT_eX]

[DOI]

Andrzej Ehrenfeucht

Grzegorz Rozenberg

Math. Syst. Theory, 1994

Measures of Nondeterminism for Pushdown Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Pumping and Pushdown Machines.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

Synchronization expressions and languages.

[BibT_eX]

[DOI]

Lifu Guo

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Rediscovering Pushdown Machines.

[BibT_eX]

[DOI]

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

Decidability of the Intercode Property.

[BibT_eX]

Helmut Jürgensen

J. Inf. Process. Cybern., 1993

Morphisms and rational tranducers.

[BibT_eX]

Bull. EATCS, 1993

Inclusion is Undecidable for Pattern Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Structural Equivalences and ET0L Grammars (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992

Confluence, ground confluence, and termination of monadic term rewriting systems.

[BibT_eX]

J. Inf. Process. Cybern., 1992

Alternation Bounds for Tree Automata.

[BibT_eX]

[DOI]

Acta Cybern., 1992

Obtaining Tight Upper Bounds for the State Complexities of DFA Operations.

[BibT_eX]

Qingyu Zhuang

Proceedings of the Computing and Information, 1992

1991

Decidability of Structural Equivalence of E0L Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Primary Types of Instances of the Post Correspondence Problem.

[BibT_eX]

Bull. EATCS, 1991

Decidability of Confluence and Termination of Monadic Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

Degrees of Nondeterminism for Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

The Immortality Problem for LAG Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

1989

Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1988

Yield-Languages Recognized by Alternating Tree Recognizers.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1988

1986

Alternating Bottom-Up Tree Recognisers.

[BibT_eX]

[DOI]