On the Descriptional Complexity of Operations on Semilinear Sets

Electronic Proceedings in Theoretical Computer Science ◽

10.4204/eptcs.252.8 ◽

2017 ◽

Vol 252 ◽

pp. 41-55 ◽

Cited By ~ 2

Author(s):

Simon Beier ◽

Markus Holzer ◽

Martin Kutrib

Keyword(s):

Descriptional Complexity ◽

Semilinear Sets

Descriptional Complexity of Formal Systems

10.1007/978-3-319-94631-3 ◽

2018 ◽

Keyword(s):

Descriptional Complexity ◽

Formal Systems

Regular chain code picture languages of nonlinear descriptional complexity

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1986 ◽

10.1007/bfb0016266 ◽

2005 ◽

pp. 414-421 ◽

Cited By ~ 2

Author(s):

Friedhelm Hinz

Keyword(s):

Chain Code ◽

Descriptional Complexity ◽

Regular Chain ◽

Picture Languages

Chop Operations and Expressions: Descriptional Complexity Considerations

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22321-1_23 ◽

2011 ◽

pp. 264-275 ◽

Cited By ~ 6

Author(s):

Markus Holzer ◽

Sebastian Jakobi

Keyword(s):

Descriptional Complexity

Descriptional complexity of concurrent processes (preliminary version)

Mathematical Foundations of Computer Science 1980 - Lecture Notes in Computer Science ◽

10.1007/bfb0022536 ◽

2005 ◽

pp. 601-611

Author(s):

Giora Slutzki

Keyword(s):

Descriptional Complexity ◽

Preliminary Version ◽

Concurrent Processes

Descriptional Complexity of Bounded Regular Languages

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-319-41114-9_11 ◽

2016 ◽

pp. 138-152 ◽

Cited By ~ 1

Author(s):

Andrea Herrmann ◽

Martin Kutrib ◽

Andreas Malcher ◽

Matthias Wendlandt

Keyword(s):

Regular Languages ◽

Descriptional Complexity

Descriptional Complexity of Formal Systems

10.1007/978-3-642-39310-5 ◽

2013 ◽

Keyword(s):

Descriptional Complexity ◽

Formal Systems

Descriptional Complexity of Biautomata

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-31623-4_15 ◽

2012 ◽

pp. 196-208 ◽

Cited By ~ 3

Author(s):

Galina Jirásková ◽

Ondřej Klíma

Keyword(s):

Descriptional Complexity

From Automata to Semilinear Sets: A Logical Solution for Sets $\mathcal{L}$ ( $\mathcal{C}$ , $\mathcal{P}$ )

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30500-2_35 ◽

2005 ◽

pp. 321-322 ◽

Cited By ~ 2

Author(s):

Denis Lugiez

Keyword(s):

Semilinear Sets

Parikh’s Theorem and Descriptional Complexity

SOFSEM 2012: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-27660-6_30 ◽

2012 ◽

pp. 361-372 ◽

Cited By ~ 1

Author(s):

Giovanna J. Lavado ◽

Giovanni Pighizzini

Keyword(s):

Descriptional Complexity

On the Boundedness Property of Semilinear Sets

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-38236-9_15 ◽

2013 ◽

pp. 156-168

Author(s):

Oscar H. Ibarra ◽

Shinnosuke Seki

Keyword(s):

Boundedness Property ◽

Semilinear Sets